Users Also Read
MCQ's Search Engine
Electrical Engineering
Mechanical Engineering
Civil Engineering
Automobile Engineering
Chemical Engineering
Computer Engineering
Electronics Engineering
Medical Science Engg
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 called | |
A. | Threaded tree [Wrong Answer] |
B. | Full binary tree [Wrong Answer] |
C. | Binary Search Tree [Wrong Answer] |
D. | Complete binary tree [Correct Answer] |