Insert, search & delete

Insert, search and delete unique keys in a binary search tree while preserving the left-smaller, right-larger ordering.

Remember: Follow comparisons; reconnect links carefully when deleting.

Example: Root 2 with children 1 and 3: deleting 2 can replace it with successor 3.

Time: O(h), worst O(n). Auxiliary space: O(h) recursive stack.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.