Category Archives: Data Structure

Tree Traversal

Traverse is one of the basic operations we apply to each data structure. In traverse, we visit every element or node of the data structure, traverse also help in searching operation when we have linear searching. Here we have provided a brief description and a python implementation of traverser operation on a binary tree.

What is Shell Sort

In sorting algorithms, we have some basic type of algorithms which can sort the elements in a specific order, often we use an array and sort its elements in numeric and lexicographical order. Shell sort is an extension and improved version of insertion sort. In insertion sort we took an element and compare it with… Read More »

What is Sorting

What is Sorting In Sorting Algorithms, we arrange the elements in a specific order it could be ascending or descending. We apply sorting algorithms on those data structures which are iterable, and most often which contain numeric data types. Though the sorting could be in any order, often we ordered our data structures element into… Read More »

What is Stack in Data?

Like an Array, Stack is an ordered collection of elements here the insertion and deletion of element take place at the same point. A stack is one of the most common Abstract Data Structures we use in programming. In the real world we often use Stack Data Structure for example when we use a browser… Read More »

Circular Linked List

As we know that a Simple linked list is a sequential collection of Nodes, and each node has a data value and a pointer variable which hold the address of the next node.  A Circular linked list is similar to Simple linked-list the only difference is, here the pointer variable of the last node point… Read More »