A binary tree in which if all its levels except possibly the last,have the maximum number of nodes
Answers
Answered by
1
it is called as complete binary tree if last level is not completed and all other levels are completed if all the levels are completed with each having 2 nodes in full binary tree
Similar questions