Question 1 1 pts

In addition to implementing the CollectionInterface, our binary search trees implement the Java Library’s Iterable interface.


Group of answer choices
True
False

Flag question: Question 2
Question 2 1 pts

An interior node is a leaf node.


Group of answer choices
True
False

Flag question: Question 3
Question 3 1 pts

A tree is a nonlinear structure in which each node is capable of having two successor nodes, called children.


Group of answer choices
True
False

Flag question: Question 4
Question 4 1 pts

The iterators created and returned by getIterator provide a snapshot of the tree as it exists at the time the iterator is requested.


Group of answer choices
True
False

Flag question: Question 5
Question 5 1 pts

When maintaining a sorted list, a binary search tree, in general allows O(Nlog2N) computing time on an insertion operation.


Group of answer choices
True
False

Flag question: Question 6
Question 6 1 pts

A binary tree is a tree in which each node is capable of having two child nodes: a left child node and a right child node.


Group of answer choices
True
False

Flag question: Question 7
Question 7 1 pts

The root node of a tree structure has no parent.


Group of answer choices
True
False

Flag question: Question 8
Question 8 1 pts

In an inorder traversal, visit the root, then visit the left subtree, and then visit the right subtree.


Group of answer choices
True
False

Flag question: Question 9
Question 9 1 pts

A tree’s subtrees must be disjoint.


Group of answer choices
True
False

Flag question: Question 10
Question 10 1 pts
A snapshot represents the state of the tree at the time the iterator is created, and subsequent changes to the tree should not affect the results returned by the iterator’s hasNext and next methods.
Group of answer choices
True
False