Return to Answer

I am posting an improved version of the algorithm put forward in the question for anyone that might be looking for a more concise answer.

I added a constructor to the Bounds class which allows me to assign the Bounds instance directly into the stack  :

I have added the Node class that I am using at @greybeard's suggestion. It only has three fields; left child node, right child node and an integer val.

The runtime is O(n). The primary advantage it has over @coderodde's solution is that it does not require the existence of the parent node.

I am posting an improved version of the algorithm put forward in the question for anyone that might be looking for a more concise answer.

I added a constructor to the Bounds class which allows me to assign the Bounds instance directly into the stack:

I have added the Node class that I am using at @greybeard's suggestion. It only has three fields: left child node, right child node and an integer val.

The runtime is \$O(n)\$. The primary advantage it has over @coderodde's solution is that it does not require the existence of the parent node.

The runtime is O(n). The primary advantage it has over @coderodde's solution is that it does not require the existence of the parent node.

I have added the Node class that I am using at @greybeard's suggestion. It only has three fields; left child node, right child node and the integer val.

I have added the Node class that I am using at @greybeard's suggestion. It only has three fields; left child node, right child node and an integer val.