Question 1

When traversing a binary tree with the pointer current,the pointer current is initialized to ____.
A) NULL
B) llink
C) rlink
D) root

Accepted Answer

When traversing a binary tree, the traversal is usually started from the root node. Therefore, the pointer current should be initialized to the root node of the binary tree.

Question 2

The ____________________ of a path in a binary tree is the number of branches on that path.

Accepted Answer

The answer of The ____________________ of a path in a...

Question 3

The sequence of operations in a postorder traversal is ____.
A) traverse left; traverse right
B) traverse left; traverse right; visit
C) visit; traverse left; traverse right
D) traverse left; visit; traverse right

Accepted Answer

Postorder traversal visits the left subtree, then the right subtree, and finally the root node. So the correct sequence of operations is to traverse left, traverse right, and then visit the node. Option B matches this sequence.

Question 4

In copying a binary tree,if you use just the value of the pointer of the root node,you get a ____ copy of the data.
A) static
B) shallow
C) deep
D) local

Accepted Answer

Using just the value of the pointer of the root node creates a shallow copy of the data, which means the new copy and original copy will share the same memory addresses for their child nodes. This can cause unintended changes to the data if either copy modifies the shared nodes. A better choice would be to perform a deep copy, where a new and separate copy of all nodes is created.

Question 5

The listing of the nodes produced by the postorder traversal of a binary tree is called the ____.
A) postsequence
B) postorder sequence
C) postorder table
D) post-script

Accepted Answer

The listing of the nodes produced by the postorder traversal of a binary tree is called the postorder sequence. This sequence lists the nodes in the order of visiting their left and right subtrees before the node itself.

Question 6

The key of the right child below the root node of a search binary tree is 40.The value in the root node could be ____.
A) 30
B) 40
C) 50
D) 60

Accepted Answer

The answer of The key of the right child below...

Question 7

In a binary search tree,the data in each node is ____ the data in the left child.
A) larger than
B) smaller than
C) equal to
D) larger or equal to

Accepted Answer

In a binary search tree, the data on the left child is always smaller than the data in any given node. This property of binary search trees allows for efficient searching and sorting algorithms. Therefore, the correct option is choice A.

Question 8

A binary tree is empty if root is ____.
A) 0
B) 1
C) "zero"
D) NULL

Accepted Answer

In programming, NULL is commonly used to represent an empty or void reference. Therefore, a binary tree is considered empty when the root node is NULL.

Question 9

The three traversal algorithms discussed for binary trees are ____,____,and ____.
A) order, preorder, postorder
B) in, preorder, order
C) order, preorder, post
D) inorder, preorder, postorder

Accepted Answer

The three traversal algorithms for binary trees are inorder, preorder, and postorder. These are the only correct options provided in option D. Option A has the correct traversal orders but uses the wrong terminology "order" instead of "inorder". Option C has the correct traversal orders but uses the incomplete term "post" instead of "postorder". Option B has a correct traversal order (inorder) but incorrect ones for preorder and postorder.

Question 10

A binary tree is also a(n)____.
A) stack
B) linked list
C) graph
D) array

Accepted Answer

A binary tree is a special type of graph where each node has at most two children. Therefore, option C is the best choice as a binary tree can be represented as a graph. Option A (stack) is not appropriate because a stack follows the LIFO principle whereas a binary tree follows a hierarchical structure. Option B (linked list) is not correct either because a linked list only allows for sequential access whereas a binary tree allows for hierarchical access. Option D (array) is also not the best choice because it is inflexible for expanding or contracting the size of the binary tree.

Question 11

In a binary search tree,the data in each node is ____ the data in the right child.
A) equal to
B) smaller than
C) greater than
D) smaller or equal to

Accepted Answer

The answer of In a binary search tree,the data in...

Question 12

The ____ of a node in a binary tree is the number of branches on the path from the root to the node.
A) height
B) level
C) width
D) size

Accepted Answer

The level of a node in a binary tree is the number of branches on the path from the root to the node. The height refers to the maximum number of edges on a path from the node to a leaf. The width and size are not related to the path from the root to a node.

Question 13

In a(n)____________________ traversal,the binary tree is traversed as follows:
 1.Traverse the left subtree
 2.Visit the node
 3.Traverse the right subtree

Accepted Answer

The answer of In a(n)____________________ traversal,the binary tree is traversed...

Question 14

The listing of the nodes produced by the preorder traversal of a binary tree is called the ____________________.

Accepted Answer

The answer of The listing of the nodes produced by...

Question 15

The most common operation performed on a binary tree is a(n)____.
A) insertion
B) deletion
C) search
D) traversal

Accepted Answer

Traversal is the most common operation performed on a binary tree as it allows us to access all the nodes/channels in the tree in a certain order. Insertion and deletion are also important operations, but they are not as frequent as traversal. Search can be important but it is not the most common operation as it is only performed when we need to find a specific node/channel in the tree.

Question 16

In a(n)____________________ traversal,the binary tree is traversed as follows:
 1. Visit the node.
 2.Traverse the left subtree.
 3.Traverse the right subtree.

Accepted Answer

The answer of In a(n)____________________ traversal,the binary tree is traversed...

Question 17

In a binary tree,the level of the children of the root node is ____.
A) 0
B) 1
C) 2
D) 3

Accepted Answer

The root node is at level 0, so its children will be at level 1. Therefore, the correct answer is B.

Question 18

The search function searches the binary search tree for a given item.If the item is found in the binary search tree,it returns ____.
A) true
B) false
C) a reference to the node where the item was found
D) 1

Accepted Answer

The answer of The search function searches the binary search...

Question 19

The ____________________ of a binary tree is the number of nodes on the longest path from the root to a leaf.

Accepted Answer

The answer of The ____________________ of a binary tree is...

Question 20

Assume the key of the left child below the root node of a binary search tree is 30.The value in the root node could be ____.
A) 0
B) 10
C) 30
D) 40

Accepted Answer

In a binary search tree, the left child contains values smaller than the parent node and the right child contains values greater than the parent node. Since the left child has a key of 30, the root node must have a value greater than 30 in order to satisfy the properties of a binary search tree. The only value greater than 30 among the given choices is 40, so the answer is D.

Quiz 19: Binary Trees

When traversing a binary tree with the pointer current,the pointer current is initialized to ____.

The ____________________ of a path in a binary tree is the number of branches on that path.

The sequence of operations in a postorder traversal is ____.

In copying a binary tree,if you use just the value of the pointer of the root node,you get a ____ copy of the data.

The listing of the nodes produced by the postorder traversal of a binary tree is called the ____.

The key of the right child below the root node of a search binary tree is 40.The value in the root node could be ____.

In a binary search tree,the data in each node is ____ the data in the left child.

A binary tree is empty if root is ____.

The three traversal algorithms discussed for binary trees are ,,and .

A binary tree is also a(n) ____.

In a binary search tree,the data in each node is ____ the data in the right child.

The ____ of a node in a binary tree is the number of branches on the path from the root to the node.

In a(n)____________________ traversal,the binary tree is traversed as follows: 1.Traverse the left subtree 2.Visit the node 3.Traverse the right subtree

The listing of the nodes produced by the preorder traversal of a binary tree is called the ____________________.

The most common operation performed on a binary tree is a(n) ____.

In a(n)____________________ traversal,the binary tree is traversed as follows: 1. Visit the node. 2.Traverse the left subtree. 3.Traverse the right subtree.

In a binary tree,the level of the children of the root node is ____.

The search function searches the binary search tree for a given item.If the item is found in the binary search tree,it returns ____.

The ____________________ of a binary tree is the number of nodes on the longest path from the root to a leaf.

Assume the key of the left child below the root node of a binary search tree is 30.The value in the root node could be ____.