Exam 17: Tree Structures

If the postorder traversal visits the nodes of a binary tree storing character values in the order of U, G, T, R, A, I, what is the visit order for an inorder traversal of the same binary tree?

A completely filled binary tree with a height of 4 has ____ nodes.

What is the complexity of adding an element to a heap?

If the postorder traversal of an expression tree is 8, 2, +, 5, /, what is the preorder traversal?

If the postorder traversal of an expression tree is, 8, 2, +, 5, /, what is the result of an inorder traversal?

Consider the following tree diagram: Which of the following statements is NOT correct?

Consider the following tree diagrams: Which are binary search trees?

You wish to traverse a binary search tree using postorder traversal. Arrange the following actions in the correct order to accomplish this. I Print the right subtree recursively II Print the root III Print the left subtree recursively

Given the BinarySearchTree class discussed in section 17.3, select a statement to complete the following code segment, so that the resulting binary search tree has a height of 4. BinarySearchTree t = new BinarySearchTree(); t.add("a"); t.add("day"); t.add("in"); __________________ t.add("life");

Consider the following tree diagrams: Which of these trees is considered to be balanced?

Consider the following tree diagram: Which of the following statements is NOT correct?

Which of the following statements about a heap is NOT correct?

If a min-heap has 15 nodes, what is known for certain? I every level of the tree is fully occupied II at least one level is missing a node III the root contains the smallest element

A binary search tree is made up of a collection of nodes organized with smaller data values on the left and greater values on the right relative to any node. Which of the following Node references must be instance variables of any implementation of a Node class? I root II left III right

Consider the following binary search tree diagram: Which nodes will be visited in order to insert the letter E into this tree?

How many times during the heapsort algorithm does the fixHeap method need to be called for a max-heap with n elements?

Consider the following tree diagrams: Which of the above are binary search trees?

Consider the following tree diagrams: Which tree represents the arithmetic expression 2 + 5 *4?

Consider the following Huffman encoding tree: The letter K will be encoded as ____.

When we map a min-heap with n elements to an array with n + 1 elements, we ignore array element 0, and place the root value at which array index?