Question 1

The number of nodes in a binary tree is the number of nodes in its left subtree plus the number of nodes in its right subtree.

Accepted Answer

A) True 
 B)False  False

Question 2

Every node in a binary tree can have pointers to

Accepted Answer

A) its end nodes. 
B) binary nodes. 
C) its left and right parent. 
D) its left and right child. 
E) None of the above 
A) its end nodes. 
B) binary nodes. 
C) its left and right parent. 
D) its left and right child. 
E) None of the above D

Question 3

The width of a tree is the largest number of nodes at the same level.

Accepted Answer

A) True 
 B)False  True

Question 4

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

Accepted Answer

A) removing a value stored in the tree. 
B) insertion of new value. 
C) searching the tree for the occurrence of a given value. 
D) All of the above 
E) None of the above 
A) removing a value stored in the tree. 
B) insertion of new value. 
C) searching the tree for the occurrence of a given value. 
D) All of the above 
E) None of the above

Question 5

In a binary search tree where all the stored values are different, the node holding the largest value cannot have two children.

Accepted Answer

A) True 
 B)False

Question 6

In a binary search tree, all nodes to the right of a node hold values greater than the node's value.

Accepted Answer

A) True 
 B)False

Question 7

Inorder, preorder, and postorder traversals can be accomplished using

Accepted Answer

A) no parameters. 
B) recursion. 
C) no arguments. 
D) no pointers. 
E) None of the above. 
A) no parameters. 
B) recursion. 
C) no arguments. 
D) no pointers. 
E) None of the above.

Question 8

Binary search trees are commonly used

Accepted Answer

A) in linear data communication processes. 
B) with arrays of integers. 
C) in database applications. 
D) A and C 
E) None of the above 
A) in linear data communication processes. 
B) with arrays of integers. 
C) in database applications. 
D) A and C 
E) None of the above

Question 9

The smallest number of levels that a binary tree with three nodes can have is two.

Accepted Answer

A) True 
 B)False

Question 10

The preorder method of traversing a binary tree involves processing the root node's data, traversing the left subtree, and then traversing the right subtree.

Accepted Answer

A) True 
 B)False

Question 11

If a node has no successor, the corresponding pointer is set to

Accepted Answer

A) NULL . 
B) the root of the tree. 
C) a leaf. 
D) point to its parent node. 
E) None of the above 
A) NULL . 
B) the root of the tree. 
C) a leaf. 
D) point to its parent node. 
E) None of the above

Question 12

Output will be the same if you use inorder, postorder, or preorder traversals to print the values stored in a binary tree.

Accepted Answer

A) True 
 B)False

Question 13

The main difference between a binary tree and a linked list is that

Accepted Answer

A) nodes in a binary tree have two successors instead of one. 
B) recursion is useful on binary trees, but not on linked lists. 
C) a linked list can be empty, but a binary tree cannot. 
D) a binary tree can be empty, but a linked list cannot. 
E) None of the above 
A) nodes in a binary tree have two successors instead of one. 
B) recursion is useful on binary trees, but not on linked lists. 
C) a linked list can be empty, but a binary tree cannot. 
D) a binary tree can be empty, but a linked list cannot. 
E) None of the above

Question 14

Binary trees are commonly used to organize key values that index database records.

Accepted Answer

A) True 
 B)False

Question 15

A node that has no children is a

Accepted Answer

A) head node. 
B) root node. 
C) pure binary node. 
D) leaf node. 
E) None of the above 
A) head node. 
B) root node. 
C) pure binary node. 
D) leaf node. 
E) None of the above

Question 16

A tree with a height of three must have

Accepted Answer

A) one root and three nodes with two children each. 
B) six nodes. 
C) three levels. 
D) three subtrees. 
E) None of the above 
A) one root and three nodes with two children each. 
B) six nodes. 
C) three levels. 
D) three subtrees. 
E) None of the above

Question 17

There exists a binary tree with a hundred nodes, but only one leaf.

Accepted Answer

A) True 
 B)False

Question 18

Deleting a node from a binary search tree node

Accepted Answer

A) is hardest when the node has two children. 
B) is hardest when the node is a leaf. 
C) is easiest when the node is the root. 
D) is hardest when the node has one child. 
E) None of the above 
A) is hardest when the node has two children. 
B) is hardest when the node is a leaf. 
C) is easiest when the node is the root. 
D) is hardest when the node has one child. 
E) None of the above

Question 19

Deleting a leaf node from a binary search tree is not difficult. Deleting a non- leaf node requires several steps.

Accepted Answer

A) True 
 B)False

Question 20

A binary tree can be created using a structure containing a data value and

Accepted Answer

A) two pointers, one for the left child and one for the right child. 
B) two data nodes. 
C) a pointer to the first child node. 
D) a pointer to the last child node. 
E) None of the above 
A) two pointers, one for the left child and one for the right child. 
B) two data nodes. 
C) a pointer to the first child node. 
D) a pointer to the last child node. 
E) None of the above

The number of nodes in a binary tree is the number of nodes in its left subtree plus the number of nodes in its right subtree.

Every node in a binary tree can have pointers to

The width of a tree is the largest number of nodes at the same level.

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

In a binary search tree where all the stored values are different, the node holding the largest value cannot have two children.

In a binary search tree, all nodes to the right of a node hold values greater than the node's value.

Inorder, preorder, and postorder traversals can be accomplished using

Binary search trees are commonly used

The smallest number of levels that a binary tree with three nodes can have is two.

The preorder method of traversing a binary tree involves processing the root node's data, traversing the left subtree, and then traversing the right subtree.

If a node has no successor, the corresponding pointer is set to

Output will be the same if you use inorder, postorder, or preorder traversals to print the values stored in a binary tree.

The main difference between a binary tree and a linked list is that

Binary trees are commonly used to organize key values that index database records.

A node that has no children is a

A tree with a height of three must have

There exists a binary tree with a hundred nodes, but only one leaf.

Deleting a node from a binary search tree node

Deleting a leaf node from a binary search tree is not difficult. Deleting a non- leaf node requires several steps.

A binary tree can be created using a structure containing a data value and

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Filters

Exam 19: Binary Trees

The number of nodes in a binary tree is the number of nodes in its left subtree plus the number of nodes in its right subtree.

Every node in a binary tree can have pointers to

The width of a tree is the largest number of nodes at the same level.

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

In a binary search tree where all the stored values are different, the node holding the largest value cannot have two children.

In a binary search tree, all nodes to the right of a node hold values greater than the node's value.

Inorder, preorder, and postorder traversals can be accomplished using

Binary search trees are commonly used

The smallest number of levels that a binary tree with three nodes can have is two.

The preorder method of traversing a binary tree involves processing the root node's data, traversing the left subtree, and then traversing the right subtree.

If a node has no successor, the corresponding pointer is set to

Output will be the same if you use inorder, postorder, or preorder traversals to print the values stored in a binary tree.

The main difference between a binary tree and a linked list is that

Binary trees are commonly used to organize key values that index database records.

A node that has no children is a

A tree with a height of three must have

There exists a binary tree with a hundred nodes, but only one leaf.

Deleting a node from a binary search tree node

Deleting a leaf node from a binary search tree is not difficult. Deleting a non- leaf node requires several steps.

A binary tree can be created using a structure containing a data value and

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Filters