Dynamic data structure with nodes connected through references. Explore different types of linked lists.

LIFO data structure supporting push and pop operations. Visualize stack operations and state.

FIFO data structure for managing ordered elements. See enqueue and dequeue in action.

A binary tree that maintains sorted data with O(log n) operations. Learn about tree traversals.

Self-balancing BST that maintains height balance. Visualize rotations and balancing.

Complete binary tree with heap property. Switch between min and max heaps.

Convert infix expressions to postfix notation using stacks. Step through the conversion process.

Simulate message queuing systems with producers and consumers. Visualize message flow.

Visualize polynomial multiplication using linked lists. See term-by-term multiplication steps.

Huffman coding is a popular data compression technique that creates variable-length prefix codes based on the frequency of characters in the input text.

Visualize Dijkstra's algorithm to find the shortest path in a graph.