MCQs>IT & Programming>Data Structures And Algorithms>What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?
Data Structures And Algorithms MCQs
What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?
Answer
Correct Answer: Complete binary tree
Explanation:
Note: This Question is unanswered, help us to find answer for this one