How to get the left and right child of a node in an unordered binary search tree?

Question

I\'m stuck with this problem: The method below must return the value in the left child node, or -1 if it not exist.

public int getLeftChild(int el) {...}
/* S