search, insert, and delete — were implemented with full step-by-step traces showing how the tree evolves. The delete operation has three cases (leaf, one child, two children) and uses the in-order successor for the two-child case.