Question 1

A balanced N-ary tree with n elements will have height ______.

Accepted Answer

The answer of A balanced N-ary tree with n elements...

Question 2

What are the advantages and disadvantages of the simulated link strategy?

Accepted Answer

The simulated link strategy stores array

Question 3

In general, a balanced n-ary tree with m elements will have height _______.

Accepted Answer

A)  lognm 
B)  logmm 
C)  logmn 
D)  lognn 
A)  lognm 
B)  logmm 
C)  logmn 
D)  lognn

Question 4

___________ traversal means visit the nodes at each level, one level at at time, starting with the root.

Accepted Answer

A)  preorder 
B)  postorder 
C)  inorder 
D)  level-order 
A)  preorder 
B)  postorder 
C)  inorder 
D)  level-order

Question 5

-In the computational strategy to implement a tree with an array, the children of node n are stored at _____.

Accepted Answer

The answer of  
-In the computational strategy to implement...

Question 6

-For the tree shown above, list the root.

Accepted Answer

The answer of  
-For the tree shown above, list...

Question 7

What is the root of the tree?

Accepted Answer

Root refers to the node at the

Question 8

________ traversal means visit the left child, then the right child, then the node.

Accepted Answer

A)  preorder 
B)  postorder 
C)  inorder 
D)  level-order 
A)  preorder 
B)  postorder 
C)  inorder 
D)  level-order

Question 9

-Preorder traversal means ______.

Accepted Answer

visit the node, then

Question 10

-For the binary tree shown, list the elements in the order generated by an InOrder traversal.

Accepted Answer

InOrder: D

Question 11

-What is the height of the tree shown above?

Accepted Answer

The answer of  
-What is the height of the...

Question 12

-For the binary tree shown, list the elements in the order generated by an PreOrder traversal.

Accepted Answer

PreOrder:

Question 13

Which method of traversing a tree would result in a sorted list for a binary search tree?

Accepted Answer

Inorder traversal of

Question 14

What is a leaf?

Accepted Answer

A leaf is

A balanced N-ary tree with n elements will have height ______.

What are the advantages and disadvantages of the simulated link strategy?

In general, a balanced n-ary tree with m elements will have height _______.

___________ traversal means visit the nodes at each level, one level at at time, starting with the root.

-In the computational strategy to implement a tree with an array, the children of node n are stored at _____.

-For the tree shown above, list the root.

What is the root of the tree?

________ traversal means visit the left child, then the right child, then the node.

-Preorder traversal means ______.

-For the binary tree shown, list the elements in the order generated by an InOrder traversal.

-What is the height of the tree shown above?

-For the binary tree shown, list the elements in the order generated by an PreOrder traversal.

Which method of traversing a tree would result in a sorted list for a binary search tree?

What is a leaf?

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Exam 9: Searching and Sorting

A balanced N-ary tree with n elements will have height ______.

What are the advantages and disadvantages of the simulated link strategy?

In general, a balanced n-ary tree with m elements will have height _______.

___________ traversal means visit the nodes at each level, one level at at time, starting with the root.

-In the computational strategy to implement a tree with an array, the children of node n are stored at _____.

-For the tree shown above, list the root.

What is the root of the tree?

________ traversal means visit the left child, then the right child, then the node.

-Preorder traversal means ______.

-For the binary tree shown, list the elements in the order generated by an InOrder traversal.

-What is the height of the tree shown above?

-For the binary tree shown, list the elements in the order generated by an PreOrder traversal.

Which method of traversing a tree would result in a sorted list for a binary search tree?

What is a leaf?

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters