Question 1

As in the case of an inorder traversal, in a postorder traversal, the first node visited is the rightmost node of the binary tree.

Accepted Answer

A) True 
 B)False

Question 2

When data is being organized, a programmer's highest priority is to organize it in such a way that item insertion, deletion, and lookups (searches) are fast.

Accepted Answer

A) True 
 B)False

Question 3

A search in a B-tree must start at the bottom node.

Accepted Answer

A) True 
 B)False

Question 4

To implement the insertion algorithm in a B-tree, we only need algorithms to split a node and insert an item into a node.

Accepted Answer

A) True 
 B)False

Question 5

When inserting into a B-tree, if the leaf is full, split the node into two nodes and the median key is moved to the ____ node.

Accepted Answer

A)  child 
B)  empty 
C)  adjacent 
D)  parent 
A)  child 
B)  empty 
C)  adjacent 
D)  parent

Question 6

To speed up item insertion and deletion in a data set, use ____.

Accepted Answer

A)  arrays 
B)  linked lists 
C)  classes 
D)  ADTs 
A)  arrays 
B)  linked lists 
C)  classes 
D)  ADTs

Question 7

After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.

Accepted Answer

A) True 
 B)False

As in the case of an inorder traversal, in a postorder traversal, the first node visited is the rightmost node of the binary tree.

When data is being organized, a programmer's highest priority is to organize it in such a way that item insertion, deletion, and lookups (searches) are fast.

A search in a B-tree must start at the bottom node.

To implement the insertion algorithm in a B-tree, we only need algorithms to split a node and insert an item into a node.

When inserting into a B-tree, if the leaf is full, split the node into two nodes and the median key is moved to the ____ node.

To speed up item insertion and deletion in a data set, use ____.

After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Standard Template Library (STL) I

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Graphs

Standard Template Library (STL) II

Filters

Exam 11: Binary Trees and B-Trees

As in the case of an inorder traversal, in a postorder traversal, the first node visited is the rightmost node of the binary tree.

When data is being organized, a programmer's highest priority is to organize it in such a way that item insertion, deletion, and lookups (searches) are fast.

A search in a B-tree must start at the bottom node.

To implement the insertion algorithm in a B-tree, we only need algorithms to split a node and insert an item into a node.

When inserting into a B-tree, if the leaf is full, split the node into two nodes and the median key is moved to the ____ node.

To speed up item insertion and deletion in a data set, use ____.

After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Standard Template Library (STL) I

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Graphs

Standard Template Library (STL) II

Filters