Question 1

To add a new element X to a heap:

Accepted Answer

A)  if the tree is empty,make X the root of a new tree;otherwise,compare X to the root,if X is less,put it in the left subtree,if it is greater,put in the right subtree 
B)  First add X in the position of the root.If X is a leaf,or is less than its children,stop.Otherwise,repeatedly swap X with the smaller of its two children until X becomes a leaf,or becomes less than its children. 
C)  Add X as a leaf,taking care to preserve the completeness of the heap.If X is now the root,or is greater than its parent,stop.Otherwise,repeatedly swap X with its parent until X becomes the root,or becomes greater than its parent. 
D)  insert X using the same algorithm for insertion in a binary search tree.If the tree remains balanced,stop.Otherwise,execute a rebalancing operation. 
A)  if the tree is empty,make X the root of a new tree;otherwise,compare X to the root,if X is less,put it in the left subtree,if it is greater,put in the right subtree 
B)  First add X in the position of the root.If X is a leaf,or is less than its children,stop.Otherwise,repeatedly swap X with the smaller of its two children until X becomes a leaf,or becomes less than its children. 
C)  Add X as a leaf,taking care to preserve the completeness of the heap.If X is now the root,or is greater than its parent,stop.Otherwise,repeatedly swap X with its parent until X becomes the root,or becomes greater than its parent. 
D)  insert X using the same algorithm for insertion in a binary search tree.If the tree remains balanced,stop.Otherwise,execute a rebalancing operation. C

Question 2

The heap sort method has a worst case complexity function that is in

Accepted Answer

A)  O(log n) 
B)  O(n. 
C)  O(n2. 
D)  O(n log n. 
A)  O(log n) 
B)  O(n. 
C)  O(n2. 
D)  O(n log n. D

Question 3

The depth of a binary tree

Accepted Answer

A)  is the length of the longest path from the root to a leaf 
B)  is the length of the shortest path from the root to a leaf 
C)  is the total number of leaves in the tree 
D)  is the depth of one of the subtrees plus one 
A)  is the length of the longest path from the root to a leaf 
B)  is the length of the shortest path from the root to a leaf 
C)  is the total number of leaves in the tree 
D)  is the depth of one of the subtrees plus one A

Question 4

A binary tree with depth d is complete if

Accepted Answer

A)  each level L < d has 2L nodes 
B)  every node that is not a leaf has 2 children 
C)  every node that is not a leaf has 2 children and and all nodes at level d are as far to the left as possible 
D)  each level L < d has 2L nodes and all nodes at level d are as far to the left as possible 
A)  each level L < d has 2L nodes 
B)  every node that is not a leaf has 2 children 
C)  every node that is not a leaf has 2 children and and all nodes at level d are as far to the left as possible 
D)  each level L < d has 2L nodes and all nodes at level d are as far to the left as possible

Question 5

A sorting algorithm based on a priority queue is

Accepted Answer

A)  quicksort 
B)  insertion sort 
C)  bubble sort 
D)  heap sort 
A)  quicksort 
B)  insertion sort 
C)  bubble sort 
D)  heap sort

Question 6

The length of the longest path from the root of a binary tree to a leaf is called

Accepted Answer

A)  the height of the tree 
B)  the level of the tree 
C)  the max-path length of the tree 
D)  the peak length of the tree 
A)  the height of the tree 
B)  the level of the tree 
C)  the max-path length of the tree 
D)  the peak length of the tree

Question 7

Consider the operation of deleting the root of a binary search tree.If the root has one child,then

Accepted Answer

A)  the root of the subtree should be recursively deleted 
B)  the element stored in the root node should be replaced with null 
C)  the reference to the root of the tree should be set to point to the one child 
D)  the operation should be recursively performed on the one subtree of the root 
A)  the root of the subtree should be recursively deleted 
B)  the element stored in the root node should be replaced with null 
C)  the reference to the root of the tree should be set to point to the one child 
D)  the operation should be recursively performed on the one subtree of the root

Question 8

Assuming a Node class
class Node
{
int element;
Node left,right;
Node(int el,Node left,Node right){
element = el;
this.left = left;
this.right = right;
}
}
Write a method int size(Node tree)that returns the number of nodes in the binary tree whose root is tree.

Accepted Answer

int size(Node tree)
{
if (tree

Question 9

A complete binary tree with N nodes may be stored in an array A of length N by storing the root at A[0],and then storing in successive array locations the nodes of the tree in increasing order of the level of nodes.If nodes in the same level are stored in left to right order,then the left child of the node stored at A[k] will be stored at

Accepted Answer

A)  A[k/2] 
B)  A[2k] 
C)  A[2k+1] 
D)  A[2k+2] 
A)  A[k/2] 
B)  A[2k] 
C)  A[2k+1] 
D)  A[2k+2]

Question 10

Consider the operation of deleting the root of a binary search tree.If the root is a leaf,then

Accepted Answer

A)  the method doing the deletion should throw an exception 
B)  the root should be replaced with a dummy place-holder node 
C)  the reference to the root of the tree should be set to null 
D)  the element stored in the root node should be replaced with null,or with 0. 
A)  the method doing the deletion should throw an exception 
B)  the root should be replaced with a dummy place-holder node 
C)  the reference to the root of the tree should be set to null 
D)  the element stored in the root node should be replaced with null,or with 0.

Question 11

A binary tree traversal method that recursively traverses the left subtree,then visits the root,then traverses the right subtree is called

Accepted Answer

A)  root-centric traversal 
B)  priority order traversal 
C)  postorder traversal 
D)  inorder traversal 
A)  root-centric traversal 
B)  priority order traversal 
C)  postorder traversal 
D)  inorder traversal

Question 12

A binary tree with no root

Accepted Answer

A)  must have only one node 
B)  must have exactly two nodes 
C)  must be empty 
D)  None of the above 
A)  must have only one node 
B)  must have exactly two nodes 
C)  must be empty 
D)  None of the above

Question 13

Postorder traversal of a binary tree

Accepted Answer

A)  first visits the root,then recursively traverses the left and right subtree 
B)  recursively traverses the left subtree,then visits the root,then traverses the right subtree 
C)  recursively traverses the left subtree,then traverses the right subtree,then visits the root 
D)  visits all the nodes according to their natural order 
A)  first visits the root,then recursively traverses the left and right subtree 
B)  recursively traverses the left subtree,then visits the root,then traverses the right subtree 
C)  recursively traverses the left subtree,then traverses the right subtree,then visits the root 
D)  visits all the nodes according to their natural order

Question 14

Let X be a node in a binary tree.Any node on the path from X to the root is called

Accepted Answer

A)  a descendant of X 
B)  an ancestor of X 
C)  a superior of X 
D)  a subordinate of X 
A)  a descendant of X 
B)  an ancestor of X 
C)  a superior of X 
D)  a subordinate of X

Question 15

The level of a node X in a binary tree

Accepted Answer

A)  is the length of a shortest path from X to a leaf 
B)  is the length of a longest path from X to a leaf 
C)  is the length of the path from the root to X 
D)  is one more than the level of a child of X 
A)  is the length of a shortest path from X to a leaf 
B)  is the length of a longest path from X to a leaf 
C)  is the length of the path from the root to X 
D)  is one more than the level of a child of X

Question 16

A complete binary tree with N nodes may be stored in an array A of length N by storing the root at A[0],and then storing in successive array locations the nodes of the tree in increasing order of the level of nodes.If nodes in the same level are stored in left to right order,then the parent of the node stored at A[k] will be stored at

Accepted Answer

A)  A[(k-1)/2] 
B)  A[k-1] 
C)  A[2k+1] 
D)  A[k/2] 
A)  A[(k-1)/2] 
B)  A[k-1] 
C)  A[2k+1] 
D)  A[k/2]

Question 17

An empty binary tree has height

Accepted Answer

A)  -1 
B)  0 
C)  1 
D)  None of the above: the height of an empty binary tree is not defined. 
A)  -1 
B)  0 
C)  1 
D)  None of the above: the height of an empty binary tree is not defined.

Question 18

To find the minimum element stored in a heap

Accepted Answer

A)  you should start at the root,and then keep passing from each node to its left child until you come to a node with no left child 
B)  you should start at the root,and then keep passing from each node to its right child until you come to a node with no right child 
C)  you should look at the root of the binary tree 
D)  you need to examine every node,and then pick the one with the least value 
A)  you should start at the root,and then keep passing from each node to its left child until you come to a node with no left child 
B)  you should start at the root,and then keep passing from each node to its right child until you come to a node with no right child 
C)  you should look at the root of the binary tree 
D)  you need to examine every node,and then pick the one with the least value

Question 19

A complete binary tree with N nodes may be stored in an array A of length N by storing the root at A[0],and then storing in successive array locations the nodes of the tree in increasing order of the level of nodes.If nodes in the same level are stored in left to right order,then the right child of the node stored at A[k] will be stored at

Accepted Answer

A)  A[k/2] 
B)  A[2k] 
C)  A[2k+1] 
D)  A[2k+2] 
A)  A[k/2] 
B)  A[2k] 
C)  A[2k+1] 
D)  A[2k+2]

Question 20

The successor of a node in a binary tree is called its

Accepted Answer

A)  neighbor 
B)  child 
C)  descendant 
D)  neighbor. 
A)  neighbor 
B)  child 
C)  descendant 
D)  neighbor.

To add a new element X to a heap:

The heap sort method has a worst case complexity function that is in

The depth of a binary tree

A binary tree with depth d is complete if

A sorting algorithm based on a priority queue is

The length of the longest path from the root of a binary tree to a leaf is called

Consider the operation of deleting the root of a binary search tree.If the root has one child,then

Assuming a Node class class Node { int element; Node left,right; Node(int el,Node left,Node right){ element = el; this.left = left; this.right = right; } } Write a method int size(Node tree)that returns the number of nodes in the binary tree whose root is tree.

Consider the operation of deleting the root of a binary search tree.If the root is a leaf,then

A binary tree traversal method that recursively traverses the left subtree,then visits the root,then traverses the right subtree is called

A binary tree with no root

Postorder traversal of a binary tree

Let X be a node in a binary tree.Any node on the path from X to the root is called

The level of a node X in a binary tree

An empty binary tree has height

To find the minimum element stored in a heap

The successor of a node in a binary tree is called its

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A First Look at Gui Applications

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File Io

Advanced Gui Applications

Applets and More

Recursion

Sorting, Searching, and Algorithm Analysis

Generics

Collections

Array-Based Lists

Linked Lists

Stacks and Queues

Filters

Exam 22: Binary Trees, Avl Trees, and Priority Queues

To add a new element X to a heap:

The heap sort method has a worst case complexity function that is in

The depth of a binary tree

A binary tree with depth d is complete if

A sorting algorithm based on a priority queue is

The length of the longest path from the root of a binary tree to a leaf is called

Consider the operation of deleting the root of a binary search tree.If the root has one child,then

Assuming a Node class class Node { int element; Node left,right; Node(int el,Node left,Node right){ element = el; this.left = left; this.right = right; } } Write a method int size(Node tree)that returns the number of nodes in the binary tree whose root is tree.

Consider the operation of deleting the root of a binary search tree.If the root is a leaf,then

A binary tree traversal method that recursively traverses the left subtree,then visits the root,then traverses the right subtree is called

A binary tree with no root

Postorder traversal of a binary tree

Let X be a node in a binary tree.Any node on the path from X to the root is called

The level of a node X in a binary tree

An empty binary tree has height

To find the minimum element stored in a heap

The successor of a node in a binary tree is called its

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A First Look at Gui Applications

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File Io

Advanced Gui Applications

Applets and More

Recursion

Sorting, Searching, and Algorithm Analysis

Generics

Collections

Array-Based Lists

Linked Lists

Stacks and Queues

Filters