A binary tree of depth d is an almost complete binary tree if – McqOptions

MCQOPTIONS

1.	A binary tree of depth d is an almost complete binary tree if
A.	Each leaf in the tree is either at level d or at level d 1
B.	For any node n in the tree with a right descendent at level d all the left descendents of n that are leaves, are also at level d
C.	Both a and b
D.	None of the above
Answer» D. None of the above

Discussion

No Comment Found

Related MCQs

In .. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.
The maximum number of nodes in a binary tree of depth 5 is
. Is a directed tree in which out degree of each node is less than or equal to two.
A B-tree of minimum degree t can maximum _____ pointers in a node.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
A binary tree is said to be a complete binary tree if all the leaf nodes of the tree are at ________.
A binary tree is said to be an extended binary tree (also known as 2-tree) if all of its nodes are of _______.
A binary tree of depth d is an almost complete binary tree if
A binary tree stored using linked representation can be converted to its mirror image by traversing it in
A BST is traversed in the following order recursively: Right, root, left. The output sequence will be in