Question $3$

Not yet answered

Marked out of $2\mathrm{.}00$

P Flag question

The leaves of an expression tree always contain?

a$.$ null

b$.$ operators

c$.$ expression

d$.$ operands

Question $4$

Not yet answered

Marked out of $2\mathrm{.}00$

P Flag question

Consider the pseudocode. What is the missing part

to check if the tree is an AVL tree?

int avl$($binarysearchtree root$)$:

if$($not root$)$

return $$

left$\_$tree$\_$height $=$ avl left$\_$of$\_$root