Complete Binary Tree depth - Data Structure

Discussion

• Nirja Shah   -Posted on 21 Nov 15
  The depth of complete binary tree of n nodes will be Dn=log ₂ (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.
  There is a difference between complete binary tree and full binary tree.
  A binary tree is called as full binary in which every node other than the leaves has two children.
  It is also called as 2-tree.
  

➨ Post your comment / Share knowledge