Question 1

In a balanced binary search tree, adding an element always requires approximately O(log2 n) steps.

Accepted Answer

A) True 
 B)False  True

Question 2

Finding an element in a balanced binary search tree that contains n elements requires _____________________ comparisons.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(2n) 
D)  O(log2 n) 
E)  none of the above 
A)  O(1) 
B)  O(n) 
C)  O(2n) 
D)  O(log2 n) 
E)  none of the above D

Question 3

Left and right rotations can be used to rebalance an unbalanced binary search tree.

Accepted Answer

A) True 
 B)False  True

Question 4

In a binary search tree, the elements in the right subtree of the root are always larger than the element stored at the root.

Accepted Answer

A) True 
 B)False

Question 5

In a binary search tree, the elements in the left subtree of the root are __________________ the root element.

Accepted Answer

A)  greater than 
B)  less than 
C)  greater than or equal to 
D)  less than or equal to 
E)  equal to 
A)  greater than 
B)  less than 
C)  greater than or equal to 
D)  less than or equal to 
E)  equal to

Question 6

In a maxheap, the largest element is always the root.

Accepted Answer

A) True 
 B)False

Question 7

A ____________________ is a complete binary tree in which each element is greater than or equal to both of its children.

Accepted Answer

A)  binary search tree 
B)  stack 
C)  full tree 
D)  heap 
E)  none of the above 
A)  binary search tree 
B)  stack 
C)  full tree 
D)  heap 
E)  none of the above

Question 8

A binary search tree is always a full tree.

Accepted Answer

A) True 
 B)False

Question 9

Describe how to find an element in a binary search tree. You may use English sentences or pseudocode.

Accepted Answer

find(x, root) :
if(x = root.getElement()

Question 10

Explain how heap sort works.

Accepted Answer

First, a maxheap is created on the eleme

Question 11

In the worst case, a general binary search tree could require __________________ comparisons to find an element.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(2n) 
D)  O(log2 n) 
E)  none of the above 
A)  O(1) 
B)  O(n) 
C)  O(2n) 
D)  O(log2 n) 
E)  none of the above

Question 12

When removing an element from a binary search tree that is a leaf, ______________ will ensure that the resulting tree is still a binary search tree.

Accepted Answer

A)  replacing it with its only child 
B)  replacing it with its inorder successor 
C)  simply deleting it 
D)  all of the above 
E)  neither a, b, nor c 
A)  replacing it with its only child 
B)  replacing it with its inorder successor 
C)  simply deleting it 
D)  all of the above 
E)  neither a, b, nor c

Question 13

A _____________________ is a tree whose elements are organized to facilitate finding a particular element when needed.

Accepted Answer

A)  full tree 
B)  complete tree 
C)  binary tree 
D)  search tree 
E)  none of the above 
A)  full tree 
B)  complete tree 
C)  binary tree 
D)  search tree 
E)  none of the above

Question 14

When adding a new element to a binary search tree, the element is added as a(n) ______________.

Accepted Answer

A)  internal node 
B)  subtree 
C)  leaf 
D)  root 
E)  none of the above 
A)  internal node 
B)  subtree 
C)  leaf 
D)  root 
E)  none of the above

Question 15

When removing an element from a binary search tree that has two children, _______________________ will ensure that the resulting tree is still a binary search tree.

Accepted Answer

A)  replacing it with its only child 
B)  replacing it with its inorder successor 
C)  simply deleting it 
D)  all of the above 
E)  neither a, b, nor c 
A)  replacing it with its only child 
B)  replacing it with its inorder successor 
C)  simply deleting it 
D)  all of the above 
E)  neither a, b, nor c

Question 16

Does the find and add operations on a binary search tree always require at most O(log2 n) comparisons? If so, why? If not, why not?

Accepted Answer

If the tree is degenerate, mea

Question 17

Explain the process of removing an element from a binary search tree.

Accepted Answer

When an element is removed from a binary

Question 18

If a binary search tree becomes unbalanced after an element is added, it is sometimes possible to efficiently rebalance the tree by ___________________ .

Accepted Answer

A)  using left and right rotations 
B)  selecting a leaf node to use as a new root 
C)  reconstructing the tree from scratch 
D)  all of the above 
E)  it is impossible to rebalance a tree efficiently 
A)  using left and right rotations 
B)  selecting a leaf node to use as a new root 
C)  reconstructing the tree from scratch 
D)  all of the above 
E)  it is impossible to rebalance a tree efficiently

Question 19

When removing an element from a binary search tree, we must always ______________________.

Accepted Answer

A)  make sure that the new tree is a binary search tree 
B)  build a new tree 
C)  find its inorder successor 
D)  remove all of its children 
E)  An element should never be removed from a binary search tree. 
A)  make sure that the new tree is a binary search tree 
B)  build a new tree 
C)  find its inorder successor 
D)  remove all of its children 
E)  An element should never be removed from a binary search tree.

Question 20

A binary search tree that is highly unbalanced is called a ________________ tree.

Accepted Answer

A)  full 
B)  complete 
C)  degenerate 
D)  unsearchable 
E)  none of the above 
A)  full 
B)  complete 
C)  degenerate 
D)  unsearchable 
E)  none of the above

In a balanced binary search tree, adding an element always requires approximately O(log₂ n) steps.

Finding an element in a balanced binary search tree that contains n elements requires _____________________ comparisons.

Left and right rotations can be used to rebalance an unbalanced binary search tree.

In a binary search tree, the elements in the right subtree of the root are always larger than the element stored at the root.

In a binary search tree, the elements in the left subtree of the root are __________________ the root element.

In a maxheap, the largest element is always the root.

A ____________________ is a complete binary tree in which each element is greater than or equal to both of its children.

A binary search tree is always a full tree.

Describe how to find an element in a binary search tree. You may use English sentences or pseudocode.

Explain how heap sort works.

In the worst case, a general binary search tree could require __________________ comparisons to find an element.

When removing an element from a binary search tree that is a leaf, ______________ will ensure that the resulting tree is still a binary search tree.

A _____________________ is a tree whose elements are organized to facilitate finding a particular element when needed.

When adding a new element to a binary search tree, the element is added as a(n) ______________.

When removing an element from a binary search tree that has two children, _______________________ will ensure that the resulting tree is still a binary search tree.

Does the find and add operations on a binary search tree always require at most O(log₂ n) comparisons? If so, why? If not, why not?

Explain the process of removing an element from a binary search tree.

If a binary search tree becomes unbalanced after an element is added, it is sometimes possible to efficiently rebalance the tree by ___________________ .

When removing an element from a binary search tree, we must always ______________________.

A binary search tree that is highly unbalanced is called a ________________ tree.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Searching and Sorting

Trees

Introduction to Collections and Stacks

Graphs

Filters

Exam 15: Heaps and Priority Queues

In a balanced binary search tree, adding an element always requires approximately O(log2 n) steps.

Finding an element in a balanced binary search tree that contains n elements requires _____________________ comparisons.

Left and right rotations can be used to rebalance an unbalanced binary search tree.

In a binary search tree, the elements in the right subtree of the root are always larger than the element stored at the root.

In a binary search tree, the elements in the left subtree of the root are __________________ the root element.

In a maxheap, the largest element is always the root.

A ____________________ is a complete binary tree in which each element is greater than or equal to both of its children.

A binary search tree is always a full tree.

Describe how to find an element in a binary search tree. You may use English sentences or pseudocode.

Explain how heap sort works.

In the worst case, a general binary search tree could require __________________ comparisons to find an element.

When removing an element from a binary search tree that is a leaf, ______________ will ensure that the resulting tree is still a binary search tree.

A _____________________ is a tree whose elements are organized to facilitate finding a particular element when needed.

When adding a new element to a binary search tree, the element is added as a(n) ______________.

When removing an element from a binary search tree that has two children, _______________________ will ensure that the resulting tree is still a binary search tree.

Does the find and add operations on a binary search tree always require at most O(log2 n) comparisons? If so, why? If not, why not?

Explain the process of removing an element from a binary search tree.

If a binary search tree becomes unbalanced after an element is added, it is sometimes possible to efficiently rebalance the tree by ___________________ .

When removing an element from a binary search tree, we must always ______________________.

A binary search tree that is highly unbalanced is called a ________________ tree.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Searching and Sorting

Trees

Introduction to Collections and Stacks

Graphs

Filters

In a balanced binary search tree, adding an element always requires approximately O(log₂ n) steps.

Does the find and add operations on a binary search tree always require at most O(log₂ n) comparisons? If so, why? If not, why not?