A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
|B.||Complete binary tree|
|C.||M-way search tree|
|D.||Full binary tree|
|Answer» B. Complete binary tree|
Login to Continue
It will take less than 2 minutes