…………………. Is a directed tree in which outdegree of each node is less than or equal to two.

Related MCQs

• In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• B-tree of order n is a order-n multiway tree in which each non-root node contains
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• ______________ a tree means processing it in such a way that each node is visited only once.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• Any node is the path from the root to the node is called