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