Build a Binary Search Tree (BST) using the given integers. Calculate the average value of all nodes. Delete all nodes whose value is greater than the average. Finally print the remaining nodes using ...

* 1. Show search path to the node being deleted (PATH, yellow). * 2. Highlight the node to delete (TARGET, green) with a pause. * 3. If replacing: highlight successor ...