If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?

Related MCQs

• 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
• trees are B-trees of order 4. They are an isometric of trees.
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the 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.
• 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___________.
• Why to prefer red-black trees over AVL trees?
• What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• If two trees have same structure and but different node content, then they are called ___