Exam 17: Tree Structures

In a binary search tree, where the root node data value = 45, what do we know about the values of all the descendants in the right subtree of the root?

If a min-heap has 1024 nodes, what is its height?

Consider the following binary search tree diagram: If node M is to be removed, which action should be taken?

A min-heap is a binary tree structure in which missing nodes may only occur where?

You are using a tree to show the evaluation order of arithmetic expressions. Which of the following statements is NOT correct?

You wish to traverse a binary search tree in sorted order using inorder 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

What is the efficiency of the heapsort algorithm?

Which of the following statements about the three tree traversal schemes studied, is correct?

Which of the following sequences of insertions will result in a balanced tree? I 12 , 7, 25, 6, 9, 13, 44 II 12 , 7, 25, 44, 13, 6, 9 III 12, 25, 44, 13, 6, 9, 7

What does the left node reference of a newly inserted binary search tree node get set to?

Consider the following tree diagram: Which of the following nodes are interior nodes?

Adding an element to a balanced binary search tree takes ____ time.

Consider the following binary search tree: Which of the following sequences correctly represents breadth-first traversal of this tree?

The height h of a completely filled binary tree with n nodes is ____.

Consider the following tree diagram: What is the size of the subtree with root P?

As implemented in the textbook, a tree class contains which of the following? I Node class II Root node III List of child nodes

When we map a min-heap with n elements to an array with n + 1 elements, the right child of the root is stored at which array index?

Consider the following binary search tree diagram: Which of the following trees represents the correct result after inserting element B?

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

Given the BinaryTree class discussed in section 17.2 (partially shown below), select an expression to complete the static recursive helper method rightMostValue, which is designed to return the data value in the rightmost node of the tree rooted at node n. public class BinaryTree { Private Node root; Public BinaryTree() { Root = null; } Public BinaryTree(Object rootData, BinaryTree left, BinaryTree right) { Root = new Node(); Root.data = rootData; Root.left = left.root; Root.right = right.root; } Class Node { Public Object data; Public Node left; Public Node right; } Public Object rightMostValue() { If (root == null) { Return null; } Else { Return rightMostValue(root); } } Public static Object rightMostValue(Node n) { If (n.right == null) { Return n.data; } Else { Return ______________________; } } }