Question 1

A heap sort sorts elements by constructing a heap out of them, and then removing them one at a time from the root.

Accepted Answer

A) True 
 B)False

Question 2

In a binary search tree, the elements in the right 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 3

What is a binary search tree?

Accepted Answer

A binary search tree is a binary tree th

Question 4

In a maxheap, the largest element in the structure is always ______________________ .

Accepted Answer

A)  a leaf 
B)  an internal node 
C)  the root 
D)  the left child of the root 
E)  the right child of the root 
A)  a leaf 
B)  an internal node 
C)  the root 
D)  the left child of the root 
E)  the right child of the root

Question 5

What is special about the order in which the nodes are visited in an inorder traversal of a binary search tree.

Accepted Answer

An inorder traversal

Question 6

The most efficient binary search trees are balanced.

Accepted Answer

A) True 
 B)False

Question 7

Consider the following binary search tree.
   What is the result of removing the following elements (in order): 13, 16, 12.

Accepted Answer

The answer of Consider the following binary search tree.
 ...

Question 8

Suppose we have a class called BinaryTree that includes a find method. If we extend the class to create a BinarySearchTree class, should we override the find method or use it as is? Explain.

Accepted Answer

The find method in the BinaryTree class

Question 9

Explain how an element is added to a heap.

Accepted Answer

An element is added to a heap as a leaf,

Question 10

Which of the following is always true when adding an element to a heap?

Accepted Answer

A)  The new element will always be a leaf. 
B)  The new element will always be the root. 
C)  The new element will always be an internal node. 
D)  The new element will always have 2 children. 
E)  none of the above is always true 
A)  The new element will always be a leaf. 
B)  The new element will always be the root. 
C)  The new element will always be an internal node. 
D)  The new element will always have 2 children. 
E)  none of the above is always true

Question 11

Draw a binary search tree that results from inserting the following elements: 12, 16, 9, 1, 15, 13

Accepted Answer

The answer of Draw a binary search tree that results...

Question 12

Finding an element in a binary search tree always requires O(log2 n) comparisons.

Accepted Answer

A) True 
 B)False

Question 13

Explain how to add an element to a binary search tree.

Accepted Answer

Elements are added to a binary search tr

Question 14

What is the inorder successor of a node in a binary search tree?

Accepted Answer

The inorder successor of a node in a bin

Question 15

Describe the steps involved in performing a right rotation on a node in a binary search tree.

Accepted Answer

Let the root node be denoted root, and d

Question 16

In a binary search tree, a new element is always added as a leaf.

Accepted Answer

A) True 
 B)False

Question 17

Whenever a new element is added to a maxheap, it always becomes the root.

Accepted Answer

A) True 
 B)False

Question 18

What is a heap?

Accepted Answer

A heap is a binary tree in whi

Question 19

Why is it important to keep a binary search tree balanced?

Accepted Answer

A balanced binary search tree

Question 20

When removing an element from a binary search tree that has a single child, _____________________ 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

A heap sort sorts elements by constructing a heap out of them, and then removing them one at a time from the root.

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

What is a binary search tree?

In a maxheap, the largest element in the structure is always ______________________ .

What is special about the order in which the nodes are visited in an inorder traversal of a binary search tree.

The most efficient binary search trees are balanced.

Consider the following binary search tree. What is the result of removing the following elements (in order): 13, 16, 12.

Suppose we have a class called BinaryTree that includes a find method. If we extend the class to create a BinarySearchTree class, should we override the find method or use it as is? Explain.

Explain how an element is added to a heap.

Which of the following is always true when adding an element to a heap?

Draw a binary search tree that results from inserting the following elements: 12, 16, 9, 1, 15, 13

Finding an element in a binary search tree always requires O(log₂ n) comparisons.

Explain how to add an element to a binary search tree.

What is the inorder successor of a node in a binary search tree?

Describe the steps involved in performing a right rotation on a node in a binary search tree.

In a binary search tree, a new element is always added as a leaf.

Whenever a new element is added to a maxheap, it always becomes the root.

What is a heap?

Why is it important to keep a binary search tree balanced?

When removing an element from a binary search tree that has a single child, _____________________ will ensure that the resulting tree is still a binary search 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

A heap sort sorts elements by constructing a heap out of them, and then removing them one at a time from the root.

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

What is a binary search tree?

In a maxheap, the largest element in the structure is always ______________________ .

What is special about the order in which the nodes are visited in an inorder traversal of a binary search tree.

The most efficient binary search trees are balanced.

Consider the following binary search tree. What is the result of removing the following elements (in order): 13, 16, 12.

Suppose we have a class called BinaryTree that includes a find method. If we extend the class to create a BinarySearchTree class, should we override the find method or use it as is? Explain.

Explain how an element is added to a heap.

Which of the following is always true when adding an element to a heap?

Draw a binary search tree that results from inserting the following elements: 12, 16, 9, 1, 15, 13

Finding an element in a binary search tree always requires O(log2 n) comparisons.

Explain how to add an element to a binary search tree.

What is the inorder successor of a node in a binary search tree?

Describe the steps involved in performing a right rotation on a node in a binary search tree.

In a binary search tree, a new element is always added as a leaf.

Whenever a new element is added to a maxheap, it always becomes the root.

What is a heap?

Why is it important to keep a binary search tree balanced?

When removing an element from a binary search tree that has a single child, _____________________ will ensure that the resulting tree is still a binary search 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

Finding an element in a binary search tree always requires O(log₂ n) comparisons.