1. Consider the tree shown at right: a) T F This is a binary tree.. b) T F This is an ordered tree. c) T F This is a balanced tree. d) T F This is a full tree. e) T F This is a perfect tree. f) T F This is a complete tree. g) Which node is the root of this tree? h) Which nodes are the leaf nodes of this tree? i) What is the height of this tree? 2. Consider the tree shown at right: a) T F This is a binary tree. b) T F This is an ordered tree. 7 5 13 10 10 11 c) T F This is a balanced tree. d) T F This is a full tree. e) T F This is a perfect tree. 11 f) T F This is a complete tree. 9) Write down the nodes of this tree in the order they would be printed if preorder traversal is used. 12 h) Write down the nodes of this tree in the order they would be printed if inorder traversal is used. 14 1) Write down the nodes of this tree in the order they would be printed if postorder traversal is used. 15 8 17 18 3. Consider the tree shown at right (same tree as in previous problem): a) Show the tree that results from removing the node 10 from this tree. Use the methods shown in class. b) Starting with your result from part (a), remove node 15. c) Starting with your result from part (b), remove node 14. 10 11 14 15 17 18