Consider a Binary Heap of size N. We need to find height of it.
Input : N = 6 Output : 2 () / \ () () / \ / () () () Input : N = 9 Output : () / \ () () / \ / \ () () () () / \ () ()
Let the size of heap be N and height be h
If we take few examples, we can notice that the value of h in a complete binary tree is ceil(log2(N+1)) – 1.
N h --------- 1 0 2 1 3 1 4 2 5 2 ..... .....
- Print path from root to all nodes in a Complete Binary Tree
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Relationship between number of nodes and height of binary tree
- Find height of a special binary tree whose leaf nodes are connected
- Check whether a binary tree is a complete tree or not | Set 2 (Recursive Solution)
- Traversal of tree with k jumps allowed between nodes of same height
- Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap
- Check if a given Binary Tree is height balanced like a Red-Black Tree
- Tournament Tree (Winner Tree) and Binary Heap
- Linked complete binary tree & its creation
- Check whether a given Binary Tree is Complete or not | Set 1 (Iterative Solution)
- Iterative Boundary traversal of Complete Binary tree
- Find the largest Complete Subtree in a given Binary Tree
- Number of edges in mirror image of Complete binary tree
- Construct Complete Binary Tree from its Linked List Representation
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.