Given the following BST Tree: (11) 29 32 50 72 Answer the following questions: 1) What is the breadth-first traversal for this tree? 2) Write the first four nodes that would be visited in preorder traversal?

Attached is an image of a binary tree: Write the order of the nodes visited in: An in-order traversal: A pre-order traversal: A post-order traversal: What is the height of the above binary tree?

Problem 3. Binary Tree Q4. Given the binary tree on the picture, match the following questions with the answers. If you cannot see the picture, please look at the pdf file BinaryTree.pdf posted under Files/Final. 1 3 4 5 What is the root? 6 7 8 How many nodes in the tree? How many leaves in the tree? 12 9 What is the height of the tree? 15 10 13 17 [Choose ] [Choose ] [Choose ] [Choose ] > > <

Insert the following key values one by one into an empty AVL tree. Restore tree as needed during the process. After the tree is built, show the post order traversal result in terms of the order of the key values visited. 30   45   65   55   50   52