Q.
A binary tree in which if all its levels except possibly the last, have the maximum number of
nodes and all the nodes at the last level appear as far left as possible, is known as
(A) full binary tree. (B) AVL tree.
(C) threaded tree. (D) complete binary tree.
Asked by rajan,
21 Jun '12 09:19 am
Earn 10 points for answering
Answers (3)
1.
Report abuse
Useful
(1)
Not Useful
(0)
Your vote on this answer has already been received
2.
Report abuse
Useful
(1)
Not Useful
(0)
Your vote on this answer has already been received
3.
Report abuse
Useful
(1)
Not Useful
(0)
Your vote on this answer has already been received