Data Structure Visualizer

Navigation

Home
Data Structures

Data Structures

Stack
Queue
Linked List
Binary Search Tree
AVL Tree
Heap

Applications

Message Queue
Infix to Postfix Conversion
Polynomial Multiplication
Huffman Coding
Dijkstra's Algorithm

Home
Visualizer
AVL Tree

AVL Tree

A self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.

Insert Node

Traversal Controls

Press enter or space to select a node.You can then use the arrow keys to move the node around. Press delete to remove it and escape to cancel.

Press enter or space to select an edge. You can then press delete to remove it or escape to cancel.