Related MCQs

• Elements in a tree can be indexed by its position under the ordering of the keys and the ordinal position of an element can be determined, both with good efficiency.
• What does the below definations convey? i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1. ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
• Why the below pseudo code where x is a value, wt is weight factor and t is root node can’t insert?
• The size value of various nodes in a weight balanced tree are leaf – zero internal node – size of it’s two children is this true?
• ELEMENT_ROTATE-WITH-LEFT-CHILD_SHOULD_TAKE_PLACE_AND_VICE_VERSA?$
• What_does_the_below_definations_convey?$
• Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as
• What are the operations that can be performed on weight balanced tree?
• What is the condition for a tree to be weight balanced. where a is factor and n is a node?
• A node of the weight balanced tree has