figure tree for exercises to show that the maximum number of nodes in binary tree of height is + full node is node with two children prove that the number of full nodes plus one is equal to the number of leaves in nonempty binary tree suppose binary tree has leaves lm at depths dm respectively -di < and determine when the equality is true prove that = give the prefixinfixand postfix expressions corresponding to the tree in figure show the result of inserting into an initially empty binary search tree show the result of deleting the root figure tree for exercise