QUESTION $11$

In copying a binary tree, if you use just the value of the pointer of the root node, you get a $\_\_\_\_$ copy of the data.

a$.$

local

b$.$

deep

c$.$

static

d$.$

shallow

$4$ points

QUESTION $12$

To describe a queuing system, we use the term $\_\_\_\_$ for the object receiving the service.

a$.$

server

b$.$

provider

c$.$

customer

d$.$

receiver

$4$ points

QUESTION $13$

A queue is a First In First Out data structure.

True

False

$4$ points

QUESTION $14$

Duplicates are allowed in a binary search tree.

True

False

$4$ points

QUESTION $15$

What is the output of the following code?

queueType queue;

int x$,$ y;

x $=2$;

y $=6$;

queue.addQueue$($x$)$;

queue.addQueue$($y$)$;

x $=$ queue.front$()$;

queue.deleteQueue$()$;

queue.addQueue$($x $+2)$;

queue.addQueue$($x$)$;

queue.addQueue$($y $-3)$;

while $(!$queue.isEmptyQueue$())$

$\{$

cout $<<$ queue.front$()<<""$;

queue.deleteQueue$()$;

$\}$

cout $<<$ endl

a$.$

$6233$

b$.$

$6242$

c$.$

$6333$

d$.$

$6423$

$4$ points

QUESTION $16$

The operations to do inorder, preorder, and postorder traversals of a binary search tree are the same as those for a binary tree.

True

False

$4$ points

QUESTION $17$

All binary tree traversals start at the left$-$most child node.

True

False

$4$ points

QUESTION $18$

When a stack is implemented as an array, the array is empty if the value of stackTop is $\_\_\_\_.$

a$.$

zero

b$.$

one

c$.$

nonzero

d$.$

equal to the size of the array

$4$ points

QUESTION $19$

Every node in a binary tree has $\_\_\_\_$ pointers.

a$.$

one

b$.$

two

c$.$

three

d$.$

four

$4$ points

QUESTION $20$

The $\_\_\_\_$ of a node in a binary tree is the number of branches on the path from the root to the node.

a$.$

height

b$.$

size

c$.$

level

d$.$

width