This question asks you about binary trees. They may not be binary search tree.

If a question has no answer, please write $-$ as your answer.$$

If the answer is NULL, please also answer $-.$

If a question has multiple answers, any answer will be accepted.

For these questions, each node stores an English letter $($A$,$ B$,$ C$,...).$ For clarity, $-$ is added to separate the letters.

For example,

$$A

$/\backslash$

$$ B$$C

has the A as the root. The left child is B; the right child is C$.$

The in$-$order output is B$-$A$-$C $(-$ is used to separate the letters$).$

The post$-$order output is B$-$C$-$A$.$

Question $13(1$ point$)$

$$

Saved

Question $13$ options:

A binary tree's in$-$order output is A$-$B$-$C$.$ The pre$-$order output is also A$-$B$-$C$.$ What is the right child of B$?$

Question $14(1$ point$)$

$$

Saved

Question $14$ options:

A binary tree's in$-$order output is A$-$B$-$C$.$ The pre$-$order output is also A$-$B$-$C$.$ What is the left child of B$?$

Question $15(1$ point$)$

$$

Saved

Question $15$ options:

A binary tree's in$-$order output is A$-$B$-$C$.$ The post$-$order output is also A$-$B$-$C$.$ What is the left child of B$?$

Question $16(1$ point$)$

$$

Saved

Question $16$ options:

A binary tree's in$-$order output is A$-$B$-$C$.$ The post$-$order output is A$-$B$-$C$.$ What is the right child of B$?$