Prof. Bolts BST Studio
Build a binary search tree and watch every operation happen: insert, search, delete, min, max, successor, predecessor and traversals, with the C code highlighted line by line.
Try it yourself
Keys are whole numbers from 0 to 999, up to 15 in a tree. Successor and predecessor use the key in the small box.