List the path from the node with info 80 to the node with info 79. A node with info 35 is to be inserted in the tree. List the nodes that are visited by the function insert to insert 35. Redraw the tree after inserting 35. Delete node 52 and redraw the binary tree. Delete node 40 and redraw the binary tree. Delete nodes 80 and 58 in that order. Redraw the binary tree after each deletion