The largest entry in a node $\backslash ($ N $\backslash )\text{'}$s left subtree is $\_\_\_\_\_\_\_\_\_.$

Question $1$ options:

the left child of $\backslash ($ N $\backslash )$

the subtree's leftmost node

the right child of $\backslash ($ N $\backslash )$

the subtree's rightmost node