# Disjoint Set ADT (Abstract Data Type)

Introduction We call two sets disjoint, if they have nothing in common. Intersection of those sets result null set. Disjoint…

Introduction We call two sets disjoint, if they have nothing in common. Intersection of those sets result null set. Disjoint…

Introduction We’ll see that how a heap can be built and in which peculiar conditions, it should be built. Let’s…

Introduction The array is efficient but the sorting is an expensive procedure. We’ve also used priority queue in simulation process,…

Introduction An array can be stored in a complete binary tree without needing the help of any pointer. Two things…

Introduction How will you find the next in-order successor in threaded binary tree? Answer is obvious, you’ll go continuously move…

Introduction In many applications, binary tree traversal are carried out repeatedly. For the traversal, we perform recursion or non-recursion, but…

Introduction This article contains some mathematical properties of binary tree. Which will help to grasp some concepts related to data…

Introduction Huffman code is method for the compression of standard text documents. It makes use of a binary tree to…

Let’s Start! The reason why we need the expression tree is that in case of compilers, when languages are translated…