The depth of a complete binary tree is given by

Related MCQs

• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• 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
• The in order traversal of tree will yield a sorted listing of elements of tree in
• In strictly binary tree, the out-degree of every node is either o or 2.
• A binary tree whose every node has either zero or two children is called
• When representing any algebraic expression E the following uses only binary operations in a 2-tree
• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
• In a Heap tree values in a node is greater than
• The time complexity of binary search is O(logn).