The number of edges from the node to the deepest leaf is called of the tree.

Related MCQs

• 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.
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• The number of edges from the root to the node is called of the tree.
• 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
• B-tree of order n is a order-n multiway tree in which each non-root node contains
• 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___________.
• In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is