Question 1

A binary tree stores data in right brances and left branches.

Accepted Answer

A) True 
 B)False  True

Question 2

A node at a higher level is called parent.

Accepted Answer

A) True 
 B)False  True

Question 3

A binary tree:

Accepted Answer

A) Has a root node. 
B) Each node has no more than two branches. 
C) Uses stacks to process the nodes. 
D) Uses two extra fields for the pointers to the branches. 
E) All of the above. 
A) Has a root node. 
B) Each node has no more than two branches. 
C) Uses stacks to process the nodes. 
D) Uses two extra fields for the pointers to the branches. 
E) All of the above. D

Question 4

To process data using inorder processing:

Accepted Answer

A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch. 
A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch.

Question 5

There are three ways to process binary trees: Preorder,Inorder,and Postorder.

Accepted Answer

A) True 
 B)False

Question 6

The bottom position of the tree is called a root

Accepted Answer

A) True 
 B)False

Question 7

Given the following data,what would the root value be if the tree were transversed as NLR, (Remember the data should be in alphabetical order. ) 
Dave
Julie
Martha
Adam
Frank
Peter
Norman

Accepted Answer

A) Julie 
B) Adam 
C) Martha 
D) Peter 
E) Norman 
A) Julie 
B) Adam 
C) Martha 
D) Peter 
E) Norman

Question 8

A binary tree is the same as a linked list.

Accepted Answer

A) True 
 B)False

Question 9

There are teo branches from every node.

Accepted Answer

A) True 
 B)False

Question 10

The top of a binary tree is a branch.

Accepted Answer

A) True 
 B)False

Question 11

Stacks are used to process a binary tree.

Accepted Answer

A) True 
 B)False

Question 12

A node on a binary tree may be a leaf.

Accepted Answer

A) True 
 B)False

Question 13

To process data using postorder processing:

Accepted Answer

A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch. 
A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch.

Question 14

To process data using preorder processing:

Accepted Answer

A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch. 
A) Node is processed first,then the left branch,then the right. 
B) The left branch is processed first,then the node and then the right branch 
C) The left branch is processed first,then the right branch,and then the node 
D) The right branch is processed first,then the node,and then the left branch.

Question 15

Inorder processing is abbreviated as:

Accepted Answer

A) NLR 
B) LNR 
C) LRN 
D) RNL 
A) NLR 
B) LNR 
C) LRN 
D) RNL

Question 16

Hashing is another method of storing and processing data.

Accepted Answer

A) True 
 B)False

Question 17

Preorder processing is abbreviated as:

Accepted Answer

A) NLR 
B) LNR 
C) LRN 
D) RNL 
A) NLR 
B) LNR 
C) LRN 
D) RNL

A binary tree stores data in right brances and left branches.

A node at a higher level is called parent.

A binary tree:

To process data using inorder processing:

There are three ways to process binary trees: Preorder,Inorder,and Postorder.

The bottom position of the tree is called a root

Given the following data,what would the root value be if the tree were transversed as NLR, (Remember the data should be in alphabetical order. ) Dave Julie Martha Adam Frank Peter Norman

A binary tree is the same as a linked list.

There are teo branches from every node.

The top of a binary tree is a branch.

Stacks are used to process a binary tree.

A node on a binary tree may be a leaf.

To process data using postorder processing:

To process data using preorder processing:

Inorder processing is abbreviated as:

Hashing is another method of storing and processing data.

Preorder processing is abbreviated as:

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

Sorting,stacks,and Queues

File Concepts

Linked Lists

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters

Exam 12: Binary Trees

A binary tree stores data in right brances and left branches.

A node at a higher level is called parent.

A binary tree:

To process data using inorder processing:

There are three ways to process binary trees: Preorder,Inorder,and Postorder.

The bottom position of the tree is called a root

Given the following data,what would the root value be if the tree were transversed as NLR, (Remember the data should be in alphabetical order. ) Dave Julie Martha Adam Frank Peter Norman

A binary tree is the same as a linked list.

There are teo branches from every node.

The top of a binary tree is a branch.

Stacks are used to process a binary tree.

A node on a binary tree may be a leaf.

To process data using postorder processing:

To process data using preorder processing:

Inorder processing is abbreviated as:

Hashing is another method of storing and processing data.

Preorder processing is abbreviated as:

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

Sorting,stacks,and Queues

File Concepts

Linked Lists

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters