A heap tree is a complete binary tree in which data values stored in any node is greater than or equal to the value of each of its children. There is only restriction between parent and its children and not within the left or right subtree...

A binary search tree abbreviated as BST is a special form of binary tree whose nodes are arranged in such a way that for every node N, the values contained in all the nodes in its left subtree are less than the value contained in node...

A binary tree is a special form of tree in which a node can have atmost two children. The two children of each node in a binary tree are called the left child and right child corresponding to their position in a binary tree representation....

A Tree is a hierarchical structure that we are already familiar with in our daily life. It is an efficient means to maintain and manipulate data in numerous examples such as a family tree, corporate management structure, military organization...

The data structure that linked lists compete directly with it the array. Each data structure has its own strengths and weaknesses. So the choice of a particular data structure depends upon the requirements of a problem. Linked list is...

Rearpeek
The rearpeek operation is used to return the element from the rear of the queue without altering the queue. As only access opeartion is performed so there is no change in the number of the elements in queue.
...

Frontpeek
In Some cases, you may want to inspect the element at the front of queue without actually removing it. This is accomplished using the Frontpeek operation. The fronkpeek operation returns the element from the front of the queue...

Dequeue
The Dequeue operation is used to remove an existing element from the front of the queue. If the queue contains more than one element then after removing the element from the front, the next older element becomes the front of...

Enqueue
The Enqueue operation is used to insert a new element to the rear if the queue. After the enqueue operation, the element that has just been inserted becomes the rear. Each enqueue operation inceases in the number of elements...

A Queue is a linear data structure in which new elements are inserted at one end and elements are deleted from the other end. By convention, the end where insertions are performed is called the rear of the queue and the other end where...