Given a binary search tree and two nodes node1 and node2, return lowest common ancestor value

Lowest common ancestor of a binary search tree

Given a <code>binary search tree</code> and two nodes <code>node1</code> and <code>node2</code>, return <code>lowest common ancestor</code> value
<blockquote>
Note: all <code>node values</code> are <code>unique</code>
</blockquote>
 
<code>Example 1</code>
<pre><code>Input: 4 node1 = 4, node1 = 5
 / \
 2 5

Output: 4
</code></pre>
<code>Example 2</code>
<pre><code>Input: 4 node1 = 2, node1 = 5
 / \
 2 5

Output: 4
</code></pre>

82: Lowest common ancestor of a binary search tree