Data Structures Animations Visual How

Hashing is a technique for storing and retrieving

Quadratic probing is another collision resolution technique used in hashing, similar to linear probing. Like linear probing ...

Depth-first search (DFS) is a graph traversal algorithm used to visit all the vertices in a graph in a depth-first order, meaning that it ...

Data Structure

Separate chaining is a collision resolution technique used in hashing, which is a

An AVL tree is a type of balanced binary search tree

In linear probing, the algorithm starts with the index where the collision occurred and searches sequentially for the next available ...

Binary tree is a type of tree

Binary search tree (BST) is a type of binary tree

Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort an array of elements. It is one of the ...

Pre-order traversal is a type of tree traversal algorithm used in computer science and programming for visiting every node in a tree ...

A Singly Linked List is a linear

Adjacency list is a

Tree

Stack is a linear

Doubly Linked List is a

Post-order traversal is a type of tree traversal algorithm used in computer science and programming for visiting every node in a ...