The depth of a complete binary tree with n' nodes is
Answers
Answered by
2
Explanation:
The depth of a complete binary tree? The depth of complete binary tree of n nodes will be Dn=log 2 (n+1). Here Dn is the height or depth of the tree and n is the number of nodes. A complete binary tree is a binary tree where all the levels have maximum number of nodes except possibly the last level
Similar questions