Exam 17: Tree Structures

Which of the following is NOT a property of a red-black tree?

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

Consider the following binary search tree diagram: If node D is to be removed, which action should be taken? Use the technique presented in the textbook.

Consider the following binary search tree diagram: If node F is to be removed, which action should be taken? Use the technique presented in the textbook.

A binary tree of height h can have up to ____ nodes.

Consider the following tree diagram: Which arithmetic expression is represented by this tree?

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 BinarySearchTree class? I root II left III right

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

Which of the following statements about binary trees is correct?

Given the Visitor interface discussed in section 17.4 (shown below), select a statement to complete the class CodeFinder. The class is to be used when traversing a binary tree while displaying every data value that contains the code "007". public interface Visitor { Void visit(Object data); } Class CodeFinder implements Visitor { Public void visit(Object data) { If (______________________________) { System.out.println(data); } } }