neednow

1(b). (12 pts) Write a routine that will delete every node in a binary tree and then print how many nodes were in the original tree before they were all deleted. You may assume that a routine called Delete exists which when called will delete the node currently being pointed to without writing a Delete routine