QUESTION $6$

A stack can be implemented as either a$($n$)\_\_\_\_$ or a linked structure.

a$.$

queue

b$.$

map

c$.$

array

d$.$

struct

$4$ points

QUESTION $7$

Which of the following is listed in the chapter as a basic operation performed on a queue?

a$.$

top

b$.$

pop

c$.$

push

d$.$

isEmptyQueue

$4$ points

QUESTION $8$

A binary tree has a special node called the $\_\_\_\_$ node.

a$.$

root

b$.$

rootleaf

c$.$

superparent

d$.$

super

$4$ points

QUESTION $9$

After deleting the desired item from a binary search tree, the resulting tree must be a binary search tree.

True

False

$4$ points

QUESTION $10$

Consider that A is a binary tree, C and D are the subtrees of A$.$ Which of the following statements is always true?

a$.$

C and D are empty trees.

b$.$

C and D are binary trees.

c$.$

C and D are search binary trees.

d$.$

A is empty.