Binary Search Tree — 2D Node-Link Diagram

This 2D companion draws the same real, pointer-linked binary search tree as a flat node-link diagram instead of an orbit-controlled 3D scene: every node is a genuine {value, left, right, parent} record, and insert, search and delete animate the exact left/right comparison walk the algorithm performs, step by step, with the visited path highlighted as it happens. A dedicated delete control removes a value using the standard three-case rule (leaf, one child, two-child successor swap), and the degeneration demo inserts values in ascending order so you can watch a balanced-looking tree collapse into a plain linked list — and see why self-balancing variants like AVL and red-black trees exist.