Question 1

What attributes should be stored in the TreeNode class?

Accepted Answer

The TreeNode class must store a pointer to the element stored in that position as well as pointers to each of the children of that node. The class may also contain a pointer to the parent of the node.

Question 2

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

Accepted Answer

PostOrder: A B D F C E

Question 3

A node that does not have a parent is called the ______ of a tree.

Accepted Answer

A)  foot 
B)  root 
C)  leaf 
D)  top 
A)  foot 
B)  root 
C)  leaf 
D)  top B

Question 4

A node that has a parent is called the root of a tree.

Accepted Answer

A) True 
 B)False

Question 5

-Inorder traversal means ______.

Accepted Answer

visit the left child

Question 6

A find operation on a balanced binary search tree is O(logn) where as a find operation for binary search tree without the balance assumption is O(n).

Accepted Answer

A) True 
 B)False

Question 7

The binary tree shown above is complete.

Accepted Answer

A) True 
 B)False

Question 8

We used a list to implement the iterator methods for a binary tree. What must be true for this strategy to be successful?

Accepted Answer

For this strategy to be successful, the

Question 9

A collection where each node can have from 0 to 2 children is called a ______ Tree.

Accepted Answer

The answer of A collection where each node can have...

Question 10

What is a tree?

Accepted Answer

A tree is a nonlinear structur

Question 11

-Level-order traversal means ______.

Accepted Answer

visit the nodes at e

Question 12

There are four basic methods for traversing a tree: preorder, inorder, postorder, and level-order.

Accepted Answer

A)  Top down, bottom up, inorder, and postorder 
B)  Top down, inorder, postorder, and level-order 
C)  Bottom up, preorder, in order, and postorder 
D)  preorder, inorder, postorder, and level-order 
A)  Top down, bottom up, inorder, and postorder 
B)  Top down, inorder, postorder, and level-order 
C)  Bottom up, preorder, in order, and postorder 
D)  preorder, inorder, postorder, and level-order

Question 13

A tree is a nonlinear structure whose elements are organized into a hierarchy.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

The answer of  
-In general, a balanced n-ary tree...

Question 15

What is a node?

Accepted Answer

Node refers to a loc

Question 16

-Postorder traversal means ______.

Accepted Answer

visit the left child

Question 17

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

Accepted Answer

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

Question 18

-For the tree shown above, list the leaves.

Accepted Answer

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

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) True 
 B)False

What attributes should be stored in the TreeNode class?

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

A node that does not have a parent is called the ______ of a tree.

A node that has a parent is called the root of a tree.

-Inorder traversal means ______.

A find operation on a balanced binary search tree is O(logn) where as a find operation for binary search tree without the balance assumption is O(n).

The binary tree shown above is complete.

We used a list to implement the iterator methods for a binary tree. What must be true for this strategy to be successful?

A collection where each node can have from 0 to 2 children is called a ______ Tree.

What is a tree?

-Level-order traversal means ______.

There are four basic methods for traversing a tree: preorder, inorder, postorder, and level-order.

A tree is a nonlinear structure whose elements are organized into a hierarchy.

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

What is a node?

-Postorder traversal means ______.

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

-For the tree shown above, list the leaves.

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

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

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

What attributes should be stored in the TreeNode class?

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

A node that does not have a parent is called the ______ of a tree.

A node that has a parent is called the root of a tree.

-Inorder traversal means ______.

A find operation on a balanced binary search tree is O(logn) where as a find operation for binary search tree without the balance assumption is O(n).

The binary tree shown above is complete.

We used a list to implement the iterator methods for a binary tree. What must be true for this strategy to be successful?

A collection where each node can have from 0 to 2 children is called a ______ Tree.

What is a tree?

-Level-order traversal means ______.

There are four basic methods for traversing a tree: preorder, inorder, postorder, and level-order.

A tree is a nonlinear structure whose elements are organized into a hierarchy.

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

What is a node?

-Postorder traversal means ______.

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

-For the tree shown above, list the leaves.

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

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

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