Building a Heap (BuildHeap)
Introduction We’ll see that how a heap can be built and in which peculiar conditions, it should be built. Let’s…
Heap
Introduction The array is efficient but the sorting is an expensive procedure. We’ve also used priority queue in simulation process,…
Complete Binary Tree
Introduction An array can be stored in a complete binary tree without needing the help of any pointer. Two things…
In-order Traversal of Threaded Binary Tree
Introduction How will you find the next in-order successor in threaded binary tree? Answer is obvious, you’ll go continuously move…
Threaded Binary Tree
Introduction In many applications, binary tree traversal are carried out repeatedly. For the traversal, we perform recursion or non-recursion, but…
Mathematical Properties of Binary Tree
Introduction This article contains some mathematical properties of binary tree. Which will help to grasp some concepts related to data…
Huffman Encoding
Introduction Huffman code is method for the compression of standard text documents. It makes use of a binary tree to…
Building the Expression Tree
Let’s Start! The reason why we need the expression tree is that in case of compilers, when languages are translated…
Uses of Binary Tree
Start We know that when user gave input in-order, it resulted in linked list. But searches for linked list become…
Deletion of Node in AVL tree
Let’s Start! We know that insertion in a height-balanced tree requires at most one single rotation or one double rotation….