Data Structures :: Trees - Discussion
6 / 194
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
Afull binary tree.
BAVL tree.
Cthreaded tree.
Dcomplete binary tree.
Show Explanation
Option D should be correct as the given statement matches the definition"A complete binary tree is a binary tree in which all the levels are completely filled except possibly the lowest one, which is filled from the left. A complete binary tree is just like a full binary tree, but with two major differences. All the leaf elements must lean towards the left."
Asked In ::
Option A is full binary tree while
Option D should be correct as the given statement matches the definition"A complete binary tree is a binary tree in which all the levels are completely filled except possibly the lowest one, which is filled from the left. A complete binary tree is just like a full binary tree, but with two major differences. All the leaf elements must lean towards the left."
Read Full Answer
Report Error
Please Login First Click Here