In strictly binary tree, the out-degree of every node is either o or 2.

Related MCQs

• Consider the following definition in c programming language struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• A binary tree whose every node has either zero or two children is called
• If every node u in G is adjacent to every other node v in G, A graph is said to be
• In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
• A node is child node if out degree is one.
• Each node in a linear list contains an item called _______ which points to the next node in the list.
• In a ________ linked list, the last node's link field points to the first node of the list.
• The second part of the node, is called _______ field, and contains the address of the next node in the list.
• A ________ linked list is a linked list which always contains a special node, called the header node.