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.
The tree is one of the most used Data Structures and there are many real-world solutions based on this data structure. Though we have Data structures like an array and linked list to store data, the time complexity of searching an element from an array and list have linear time complexity. Suppose there is a list or array… Read More »
Breadth-First Search is another algorithm like Depth First Search which is used to search a particular vertex. It is also Known as Breadth-First Traversal because with its help we can traverse through any graph data structures. As we know that all tree structures are graph structures so the BFS algorithm can also be applied to the tree data… Read More »
Graph and Trees are two similar like Data structures with some difference, and Depth First Search is a traversing or searching algorithm that can apply to both the structures. The DFS algorithm was investigated by Charles Pierre Trémaux back in the 19th century. Here in this article, we have covered the DFS (Depth First Search) algorithm for Graph… Read More »
In sorting, 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 take an element and compare it with the previous elements to… Read More »
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 numerical or lexicographical… Read More »
Like a Stack, Queue is also an Ordered collection of elements or items. In a queue, the addition of new elements and removal of old ones occur on opposite ends. The end at which the new element gets inserted is known as rear end and the end from which the old element gets removed is known as front… Read More »
Here in this program, we will code to find the largest and smallest element from a 1D Array.
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 to surf the… Read More »
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 to the head… Read More »