QUESTION $21$

A node in a binary tree is called a$($n$)\_\_\_\_$ if it has no left and right children.

a$.$

leaf

b$.$

path

c$.$

edge

d$.$

branch

$4$ points

QUESTION $22$

If you try to add a new item to a full stack, the resulting condition is called a$($n$)\_\_\_\_.$

a$.$

override

b$.$

overflow

c$.$

overload

d$.$

underflow

$4$ points

QUESTION $23$

A stack is a$($n$)\_\_\_\_$ data structure.

a$.$

FIFO

b$.$

FILO

c$.$

LIFO

d$.$

LILO

$4$ points

QUESTION $24$

In the array representation of a stack, if a value called stackTop indicates the number of elements in the stack, then stackTop$-1$ points to the top item of the stack.

True

False

$4$ points

QUESTION $25$

Popping an element from an empty stack is called $\_\_\_\_.$

a$.$

underflow

b$.$

exception

c$.$

overloading

d$.$

overflow