How to compute the height of a complete binary tree?
Answers
Answered by
0
The height of a binary tree is the largest number of edges in a path from the root node to a leaf node.
Then the height is -1 where the tree has no nodes
Then the height is -1 where the tree has no nodes
Similar questions