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
Answer:A
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