Can someone please show me a simple way to find the in order of sucessor and predecessor in this tree? a simple idea $?$ Use the $23$ tree below to answer a$)$ to d$)$

$(5$ points$)$

a$)$ The in$-$order predecessor of node $A$ is node:

b$)$ The in$-$order successor of node $A$ is node:

c$)$ The in$-$order predecessor of node $B$ is node:

d$)$ The in$-$order successor of node $B$ is node:

e$)$ The largest node that is less than node $L$ is: