B-tree of order n is a order-n multiway tree in which each non-root node contains

Related Questions

• 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
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
• 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.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• 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
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• ______________ a tree means processing it in such a way that each node is visited only once.