Question 1

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 2

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

Accepted Answer

A) True 
 B)False

Question 3

A node that has no children is a

Accepted Answer

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

Question 4

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

Accepted Answer

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

Question 5

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

Question 6

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

Accepted Answer

A)   
C)  == 
D)  All of the above 
E)  None of the above 
A)   
C)  == 
D)  All of the above 
E)  None of the above

Question 7

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

Accepted Answer

A)  the leftmost child node. 
B)  the first leaf node. 
C)  the root of the tree. 
D)  the deepest leaf node. 
E)  None of the above 
A)  the leftmost child node. 
B)  the first leaf node. 
C)  the root of the tree. 
D)  the deepest leaf node. 
E)  None of the above

Question 8

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

Accepted Answer

A)  binary queue. 
B)  binary ordered deque. 
C)  binary search tree. 
D)  sort algorithm. 
E)  None of the above 
A)  binary queue. 
B)  binary ordered deque. 
C)  binary search tree. 
D)  sort algorithm. 
E)  None of the above

Question 9

A program keeps track of a binary tree using a pointer to

Accepted Answer

A)  one of its leaves. 
B)  its root node. 
C)  the node in the tree holding the biggest value. 
D)  the node in the tree holding the smallest value. 
E)  None of the above 
A)  one of its leaves. 
B)  its root node. 
C)  the node in the tree holding the biggest value. 
D)  the node in the tree holding the smallest value. 
E)  None of the above

Question 10

Binary search trees are commonly used

Accepted Answer

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

Question 11

A strong reason to use a binary search tree is

Accepted Answer

A)  to expedite the process of searching large sets of information. 
B)  aesthetics and program design. 
C)  to enhance code readability. 
D)  it is more flexible than the unary search tree. 
E)  None of the above 
A)  to expedite the process of searching large sets of information. 
B)  aesthetics and program design. 
C)  to enhance code readability. 
D)  it is more flexible than the unary search tree. 
E)  None of the above

Question 12

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

Accepted Answer

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 the above 
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 the above

Question 13

The height of a binary tree describes how many levels there are in the tree.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

One method of traversing a binary tree is

Accepted Answer

A)  inorder traversal. 
B)  preorder traversal. 
C)  postorder traversal. 
D)  All of the above 
E)  None of the above 
A)  inorder traversal. 
B)  preorder traversal. 
C)  postorder traversal. 
D)  All of the above 
E)  None of the above

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

Deleting a node from a binary search tree node

Accepted Answer

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

Question 18

A tree with a height of three must have

Accepted Answer

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

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

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

A node that has no children is a

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

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.

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

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

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

A program keeps track of a binary tree using a pointer to

Binary search trees are commonly used

A strong reason to use a binary search tree is

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

The height of a binary tree describes how many levels there are in the tree.

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

One method of traversing a binary tree is

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

Deleting a node from a binary search tree node

A tree with a height of three must have

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, 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

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

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

A node that has no children is a

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

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.

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

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

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

A program keeps track of a binary tree using a pointer to

Binary search trees are commonly used

A strong reason to use a binary search tree is

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

The height of a binary tree describes how many levels there are in the tree.

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

One method of traversing a binary tree is

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

Deleting a node from a binary search tree node

A tree with a height of three must have

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, 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