A Binary tree is a special tree where each node can have no more than two children. A non-empty binary tree consist of the following: A node called the root node. A left sub-tree. A right sub-tree. Both the sub-trees are themselves binary trees. Types of Binary Trees Complete Binary Tree The tree T is […]
A tree is a non-linear data structure that organizes data in a hierarchical structure and this is a recursive definition. It is a set of one or more nodes, with one node identified as the tree’s root and all remaining nodes partitionable into non-empty sets, each of which is a subtree of the root. Since
Tree Data Structure Read More »
A priority queue is a collection of elements, in which each element has been assigned a priority value. The order in which the elements will be processed is decided by the priority of the element. An element with higher priority is processed first. If elements with the same priority occur, they are processed according to the order
Limitation of Linear Queue Look at the following queue. You cannot insert a new value now, because the queue is completely full. Consider the following case: two consecutive deletions are made. Even though there is enough space to hold a new element, the overflow condition still occurs since the condition rear = MAX – 1 is
A Queue is a linear data structure in which deletions can only occur at one end, known as the front, and insertions can only occur at the other end, known as the rear. It is similar to the real-life queue where the first person entering the queue is the first person who comes out of the
