Question 1

When an application begins searching a binary tree, it starts at ________.
A)the outermost leaf node
B)the middle node, halfway between the root and the longest branch
C)the root node
D)the rightmost child of the root node
E)None of these

Accepted Answer

The root node is the starting point for searching a binary tree. From there, an application can traverse the tree and search for a specific node or data point. Starting at the outermost leaf node or the rightmost child of the root node would not be efficient for searching the entire tree. Starting at the middle node would also not be optimal as the structure of the tree can vary, and the longest branch may not always be in the middle.

Question 2

The head pointer, anchored at the top of a binary tree, is called the ________.
A)root node
B)tree pointer
C)binary pointer
D)Either A or C
E)None of these

Accepted Answer

B

Question 3

Binary trees can be divided into:
A)branches
B)leaves
C)subtrees
D)sawdust
E)None of these

Accepted Answer

Binary trees can be divided into subtrees, which are smaller binary trees that branch off from a parent node. Branches and leaves are parts of the overall structure of a binary tree, but they do not divide the tree into distinct smaller trees. "Sawdust" is not a valid division of a binary tree. Therefore, the best choice is C, subtrees.

Question 4

In a binary tree, each node may point to ________ other nodes.
A)no
B)one
C)two
D)All of these
E)None of these

Accepted Answer

In a binary tree, each node can point to zero, one, or two other nodes, making all the options possible.

Question 5

The first node in a binary tree list is called the ________.
A)head pointer
B)binary node
C)root node
D)pointer node
E)None of these

Accepted Answer

The first node in a binary tree list is called the root node. This is because the root node is the topmost node in the hierarchy of nodes in a binary tree and is the starting point for traversing the tree. The head pointer is a pointer that points to the first node in a linked list and is not applicable to binary trees. Binary node and pointer node are not specific enough to describe the first node in a binary tree.

Question 6

In a non-linear linked list, a node can point to:
A)only the next node in sequence
B)only the previous node in sequence
C)more than one other node, plus the previous node in sequence
D)all of the other nodes in the list
E)None of these

Accepted Answer

In a non-linear linked list, nodes can have multiple pointers, allowing them to point to more than one other node in the list, as well as to the previous node in sequence. This creates a complex web of interlinked nodes, rather than a linear sequence.Option A is incorrect because it limits the node to only pointing to the next node, whereas option B limits it to only pointing to the previous node.Option D is incorrect because a node cannot point to itself or to nodes that are not in the list. Option E is incorrect because there are valid answers.

Question 7

The ________ in a binary tree is similar to the head pointer in a linked list.
A)root pointer
B)leaf pointer
C)null pointer
D)binary pointer
E)None of these

Accepted Answer

The root pointer in a binary tree points to the topmost node of the tree, just like the head pointer in a linked list points to the first node of the list.

Question 8

Values are typically stored in a binary search tree so that a node's ________ child holds data is less than the ________ data.
A)right, node's
B)left, node's
C)right, left child's
D)left, right child's
E)None of these

Accepted Answer

In a binary search tree, values that are smaller than the current node are stored in its left subtree, and values that are larger than the current node are stored in its right subtree. Therefore, the correct choice is B, which states that a node's left child holds data that is less than the node's data.

Question 9

The process of stepping through the nodes of a binary tree is known as ________.
A)climbing
B)traversing
C)walking through
D)branching out
E)None of these

Accepted Answer

The process of moving through a binary tree, visiting each node exactly once, is called "traversing."

Question 10

Deleting a node that has two children offers an opportunity to use:
A)a function that returns a pointer to a pointer
B)a function parameter that is a pointer to a pointer
C)double indirection
D)All of these
E)None of these

Accepted Answer

When deleting a node with two children, we need to update the pointers of the left and right subtrees to maintain the binary search tree property. This requires manipulating the pointer to the parent node's pointer, which can be achieved through a function that returns a pointer to a pointer (option A) or a function parameter that is a pointer to a pointer (option B). This also involves double indirection (option C) because we need to dereference the parent node's pointer to access the child node's pointer. Therefore, all of these options are useful in this scenario.

Question 11

A node that has no children is known as a ________.
A)root node
B)head node
C)leaf node
D)pure binary node
E)None of these

Accepted Answer

A leaf node is a node that has no children, hence it is the correct choice. A root node is the topmost node of a tree, a head node is not a commonly used term in tree data structures, and a pure binary node is not a recognized term in computer science.

Question 12

A good reason to use the binary tree structure is:
A)to expedite the process of searching large sets of information
B)aesthetics and program design
C)code readability
D)it is more flexible than the Unary Tree structure
E)None of these

Accepted Answer

Binary trees allow for efficient searching and access of data, making them a good choice for managing large sets of information. The binary tree structure allows for logarithmic time complexity for search and insertion operations, making it faster than other tree structures such as unary trees. Aesthetics and program design, code readability, and being more flexible are not necessarily unique advantages of the binary tree structure.

Question 13

An operation that can be performed on a binary search tree is:
A)insertion
B)finding
C)deleting
D)All of these
E)None of these

Accepted Answer

All of these operations (insertion, finding, and deleting) can be performed on a binary search tree. Insertion allows new values to be added to the tree, finding allows a value to be located within the tree, and deleting removes a value from the tree.

Question 14

All node pointers that do not point to other nodes are set to:
A)the root of the tree
B)a parent node
C)their left-most child node
D)a null pointer
E)None of these

Accepted Answer

When a node pointer does not point to any other node, it is typically set to a null pointer. This indicates that the node has no children or does not have a parent. A null pointer is a common convention in programming languages to represent a variable with no value.

Question 15

Binary trees may be implemented as templates, but any data types used with them must support the ________ operator.
A)<
B)>
C)==
D)All of these
E)None of these

Accepted Answer

Binary trees often require comparison operations to maintain order, such as determining the position of nodes. Therefore, data types used with them must support comparison operators like <, >, and ==.

Question 16

When working with a binary tree, a node that has more than two children:
A)will be cut back by the compiler
B)is theoretically impossible in a correctly-developed binary tree structure
C)is known as a triplet node
D)None of these

Accepted Answer

A binary tree is a tree data structure in which each node has at most two children, therefore it is theoretically impossible for a node to have more than two children in a correctly developed binary tree structure.

Question 17

A binary tree can be created using a struct or class containing a data value and ________.
A)a pointer to the first child node
B)a pointer to the last child node
C)two pointers, one for the left child and one for the right child
D)two data nodes
E)None of these

Accepted Answer

In a binary tree, each node can have at most two children, one on the left and one on the right. Therefore, the best choice is to have two pointers, one for the left child and one for the right child, to connect the nodes in the tree.

Question 18

When the root node points to two other nodes, the nodes are referred to as ________.
A)child nodes, or children
B)parent nodes, or parents
C)binary nodes
D)subnodes
E)None of these

Accepted Answer

When the root node points to two other nodes, these nodes are referred to as child nodes or children. This is because the root node is considered the parent of these nodes, and they are its offspring or descendants. Option B, parent nodes or parents, would be incorrect as the root node is already the parent in this scenario. Option C, binary nodes, may be confusing as binary trees specifically refer to trees in which each node can only have at most two children. Option D, subnodes, is not a commonly used term in tree data structure terminology.

Question 19

When a binary tree is used to facilitate a search, it is referred to as a ________.
A)binary queue
B)binary ordered deque
C)binary search tree
D)sort algorithm
E)None of these

Accepted Answer

A binary search tree is specifically designed for efficient searching. It has the property that the left subtree of any node contains only keys less than the node's key, and the right subtree contains only keys greater than the node's key. This allows for efficient searching by recursively traversing either the left or right subtree based on the comparison of the node's key with the search key. The other choices are not related to binary tree-based searching.

Question 20

When you dereference a pointer to a pointer, the result is:
A)a value of the data type pointed to
B)another pointer
C)not possible to determine
D)a null pointer
E)None of these

Accepted Answer

When a pointer to a pointer is dereferenced, the result obtained is another pointer, which can be further dereferenced to obtain the value being pointed to.

Quiz 20: Binary Trees

When an application begins searching a binary tree, it starts at ________.

The head pointer, anchored at the top of a binary tree, is called the ________.

Binary trees can be divided into:

In a binary tree, each node may point to ________ other nodes.

The first node in a binary tree list is called the ________.

In a non-linear linked list, a node can point to:

The ________ in a binary tree is similar to the head pointer in a linked list.

Values are typically stored in a binary search tree so that a node's child holds data is less than the data.

The process of stepping through the nodes of a binary tree is known as ________.

Deleting a node that has two children offers an opportunity to use:

A node that has no children is known as a ________.

A good reason to use the binary tree structure is:

An operation that can be performed on a binary search tree is:

All node pointers that do not point to other nodes are set to:

Binary trees may be implemented as templates, but any data types used with them must support the ________ operator.

When working with a binary tree, a node that has more than two children:

A binary tree can be created using a struct or class containing a data value and ________.

When the root node points to two other nodes, the nodes are referred to as ________.

When a binary tree is used to facilitate a search, it is referred to as a ________.

When you dereference a pointer to a pointer, the result is: