Question 1

In the diagram of a binary tree, an arrow is called a(n) ____.
A) relation
B) path
C) directed line
D) directed branch

Accepted Answer

In the context of a binary tree, an arrow connecting a node to its child is called a directed branch or edge. It is directed because it points from the parent node to the child node, indicating the direction of the relationship between them. Option A is incorrect because a relation is a broader term that can refer to any type of connection or association between two or more things. Option B is incorrect because a path refers to a sequence of connected edges in a graph or tree that leads from one node to another. Option C is not incorrect but is less specific than option D.

Question 2

Every node in a binary tree has at most ____ children.
A) one
B) two
C) three
D) four

Accepted Answer

By definition, a binary tree has at most two children for each node. Therefore, the correct answer is B) Two.

Question 3

A node in a binary tree is called a(n) ____ if it has no left and right children.
A) edge
B) branch
C) leaf
D) path

Accepted Answer

A leaf node in a binary tree is a node that has no left or right child. So, option C is the correct answer. Option A is not correct as an edge is a connection between two nodes. Option B is not correct as a branch is a node with at least one child. Option D is not correct as it refers to a sequence of nodes and edges from the root to a leaf node.

Question 4

The level of the root node of a binary tree is 1.

Accepted Answer

The level of the root node of a binary tree is 0, as levels are typically counted starting from 0.

Question 5

In a binary tree, the branches go only from a child to a parent.

Accepted Answer

In a binary tree, the branches go from a parent to its children, not from a child to a parent.

Question 6

To delete an item from the binary search tree, you must do the following:1.Find the node containing the item (if any) to be deleted.
2.Delete the node.

Accepted Answer

To delete an item from a binary search tree, you must first find the node that contains the item. Once the node is found, it can be deleted from the tree. Therefore, both steps - finding the node and deleting it - are necessary to successfully remove an item from the tree.

Question 7

Duplicates are allowed in a binary search tree.

Accepted Answer

In a binary search tree, each node must have a unique key value to maintain the property that the left subtree contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.

Question 8

Every node in a binary tree has ____ pointers.
A) one
B) two
C) three
D) four

Accepted Answer

Every node in a binary tree has two pointers, one pointing to its left child and the other pointing to its right child.

Question 9

For classes with pointer data members, you must explicitly overload the assignment operator and include the destructor.

Accepted Answer

When a class contains pointer data members, the default assignment operator and destructor provided by the compiler may not be sufficient. Therefore, it is necessary to overload the assignment operator to ensure proper copying of dynamically allocated memory and to include a destructor to free that memory when the object is destroyed.

Question 10

All binary tree traversals start at the left-most child node.

Accepted Answer

Binary tree traversals can start from any node, not just the left-most child node. There are different types of traversals such as inorder, preorder and postorder which start from different nodes.

Question 11

Three lines at the end of an arrow in the diagram of a binary tree indicate that the subtree ____.
A) has three branches
B) has three children
C) is full
D) is empty

Accepted Answer

In the context of binary tree diagrams, three lines at the end of an arrow typically indicate that the subtree is empty, meaning there are no nodes present in that part of the tree.

Question 12

The operations to do inorder, preorder, and postorder traversals of a binary search tree are the same as those for a binary tree.

Accepted Answer

Inorder, preorder, and postorder traversal algorithms are not affected by whether a binary tree is a binary search tree or not. The algorithms only depend on the structure of the binary tree, not its contents. Therefore, the operations for traversing a binary search tree are the same as those for traversing a binary tree.

Question 13

Consider that A is a binary tree, C and D are the subtrees of A.Which of the following statements is always true?
A) C and D are binary trees.
B) C and D are search binary trees.
C) C and D are empty trees.
D) A is empty.

Accepted Answer

Since C and D are subtrees of A, they are also binary trees, regardless of whether they are search binary trees or empty trees. Therefore, option A is always true. Option B and C are not necessarily true, and option D contradicts the assumption that A is a non-empty binary tree.

Question 14

A pointer to the root node of the binary tree is stored outside the binary tree in a pointer variable, usually called the ____.
A) node
B) parent
C) root
D) nodeType

Accepted Answer

The pointer variable that stores the address of the root node is typically named "root."

Question 15

The item search, insertion, and deletion operations all require the binary tree to be traversed.

Accepted Answer

Binary search trees require traversal in order to search, insert or delete nodes.

Question 16

In C++, a function name without any parentheses is considered a pointer to the function.

Accepted Answer

In C++, a function name without any parentheses is considered a pointer to the function. This is because the name of the function represents its memory address. Therefore, it can be assigned to a function pointer or used as a parameter to a function that expects a pointer to a function.

Question 17

In a diagram of a binary tree, each node is represented as a(n) ____.
A) line
B) triangle
C) circle
D) rectangle

Accepted Answer

In a binary tree diagram, each node is commonly represented by a circle. This helps to distinguish the nodes from other elements in the diagram such as lines or arrows, which are sometimes used to show the relationships between nodes in the tree. Triangles and rectangles are less commonly used to represent nodes in binary trees.

Question 18

A binary tree has a special node called the ____ node.
A) super
B) root
C) superparent
D) rootleaf

Accepted Answer

The root node is the special node in a binary tree that serves as the starting point for traversing the tree. It does not have any parent node, but all other nodes in the tree are descendants of the root node. Therefore, option B, "root", is the correct choice.

Question 19

After deleting the desired item from a binary search tree, the resulting tree must be a binary search tree.

Accepted Answer

When deleting a node from a binary search tree, the tree must be restructured to maintain the binary search property. However, if the correct steps are taken to restructure the tree, the resulting tree will still be a valid binary search tree.

Question 20

Each link in a binary tree node points to a(n) ____ of that node.
A) parent
B) child
C) value
D) sibling

Accepted Answer

A link in a binary tree points to a child of that node, as each node in a binary tree can have at most two children (hence the "binary" part), represented as left and right child. A link pointing to the parent or sibling is not relevant to that specific node. A value is typically stored within the node itself, not as a link.

Quiz 19: Binary Trees

In the diagram of a binary tree, an arrow is called a(n) ____.

Every node in a binary tree has at most ____ children.

A node in a binary tree is called a(n) ____ if it has no left and right children.

The level of the root node of a binary tree is 1.

In a binary tree, the branches go only from a child to a parent.

To delete an item from the binary search tree, you must do the following:1.Find the node containing the item (if any) to be deleted. 2.Delete the node.

Duplicates are allowed in a binary search tree.

Every node in a binary tree has ____ pointers.

For classes with pointer data members, you must explicitly overload the assignment operator and include the destructor.

All binary tree traversals start at the left-most child node.

Three lines at the end of an arrow in the diagram of a binary tree indicate that the subtree ____.

The operations to do inorder, preorder, and postorder traversals of a binary search tree are the same as those for a binary tree.

Consider that A is a binary tree, C and D are the subtrees of A.Which of the following statements is always true?

A pointer to the root node of the binary tree is stored outside the binary tree in a pointer variable, usually called the ____.

The item search, insertion, and deletion operations all require the binary tree to be traversed.

In C++, a function name without any parentheses is considered a pointer to the function.

In a diagram of a binary tree, each node is represented as a(n) ____.

A binary tree has a special node called the ____ node.

After deleting the desired item from a binary search tree, the resulting tree must be a binary search tree.

Each link in a binary tree node points to a(n) ____ of that node.