# Category: Data Structure Tutorials

Data Structure Tutorials Introduction to Data Structures Data Structure and Algorithm Data Structures Asymptotic Analysis Divide and Conquer Greedy Algorithm with Applications Linked List Doubly Linked Circular Linked List Stack in Data Structure Queue...

Data structures and algorithms are some of the most important topics for any technical interview. Most of the companies have a special interview round based on data structures and algorithms. This article contains a...

In programming, we usually represent a 2-D array in the form of a matrix. However, if a matrix has most of its elements equal to zero, then the matrix is known as a sparse...

Tree traversal means visiting each node of the tree. The tree is a non-linear data structure, and therefore its traversal is different from other linear data structures. There is only one way to visit...

Data structures are a very important part and a key component of computer science. Without the presence of different types of data structures, it is impossible to store the information effectively. Data structures are...

A Hash table is a type of data structure that makes use of the hash function to map values to the key. This data structure stores values in an associative manner i.e. it associates...

Fibonacci series is a special kind of series in which the next term is equal to the sum of the previous two terms. Thus, the initial two numbers of the series are always given...

The Tower of Hanoi is a mathematical puzzle containing 3 pillars/towers with n disks each of a different size/diameter. These disks can slide onto any pillar. The following diagram shows the initial state of...

A spanning tree is a tree that connects all the vertices of a graph with the minimum possible number of edges. Thus, a spanning tree is always connected. Also, a spanning tree never contains...

An AVL tree is a height-balanced binary search tree. The AVL tree is named after its inventors: Adelson-Velsky and Landis. In an AVL tree, the heights of the two-child subtrees can differ by utmost...