Binary Search Tree in Data Structure
A binary search tree(BST) is a special type of binary tree and is also known as a sorted or ordered binary tree. In a binary search tree: The value of the left node is...
Category: Data Structure Tutorials
Binary Tree Data Structure
A binary tree is a tree in which every node has either 0, 1 or 2 children. If it has zero children, it means the node is a leaf node. If the node has...
Tree in Data Structure
What is a Tree Data Structure? A tree is a non-linear data structure. In a tree, data is stored in the hierarchical form at multiple levels. This data is stored in nodes. The nodes...
Breadth First Search in Data Structure
Traversal means to visit each node of a graph. For graphs, there are two types of traversals: Depth First traversal and Breadth-First traversal. In this article, we are going to study Breadth-first traversal or...
Depth First Search in Data Structure
A graph is a non-linear data structure. Therefore, its traversing requires special algorithms. There are majorly two ways to traverse a tree or a graph: Depth-first search and breadth-first search. Depth First Search is...
Graphs in Data Structure
In this article, we will learn about the graphs in data structure. There are mainly 2 types of data structures: Linear and Non-linear. Linear data structures include arrays, linked lists, stacks, queues, etc. whereas...
Heap Sort – Algorithm, Working and Implementation
Heap sort is a sorting technique based upon heap data structure. It makes use of a binary heap for sorting the elements. Heapsort is a comparison-based sorting algorithm. It is an inplace sorting technique....
Shell Sort in Data Structure
Shell sort is a special case of insertion sort. It was designed to overcome the drawbacks of insertion sort. Thus, it is more efficient than insertion sort. In shell sort, we can swap or...
Quick Sort in Data Structure
Just like bubble sort and merge sort, quick sort is also a divide and conquer strategy. It is a comparison-based sorting algorithm but not a stable technique. It is an inplace sorting technique. It...
Merge Sort in Data Structure
Merge sort is a sorting algorithm based on the Divide and conquer strategy. It works by recursively dividing the array into two equal halves, then sort them and combine them. It takes a time...