About this visualizer

What it is

A learning assistant for the augmented data structures part of the course. Insert values into a plain binary search tree, an AVL tree, a red-black tree, or a 2-3 tree, and watch each one take shape step by step — the comparisons on the way down, and then whatever the structure does to stay balanced: a rotation, a recolour, or a split that promotes a median.

Where the steps come from

The course pages on augmented data structures and 2-3 trees. The app follows their treatment closely — the balance factor is height of right subtree minus height of left subtree, as the notes define it; the red-black fix-up is the notes' own case analysis; and the course's worked insertion sequences load with one click, so you can read the page and the app side by side. Every step is generated deterministically in your browser; nothing runs on a server.

Scope

The focus is insertion — that is where balancing is decided, and it is what the course pages work through. The plain binary search tree also supports removal, including the two-children case that promotes the inorder successor. Removal from the balanced trees, and the proofs of their height bounds, are left to the notes.

Privacy

• Everything runs in your browser; the values you enter never leave it.
• No login, no accounts, no database, no AI.

Family

Part of the DSA tools family — the grid menu in the top bar lists the rest. Version 0.3.0.