title: How to find and return bottom-most(Deepest Node) node of a binary tree? binary search tree?
body: <p>I have a <code>binary tree</code> with the only condition that there is a single node in the deepest level.  The nodes in the tree have the parent property (as well as left, right, data)</p>
  
  <p>Is it possible to determine what the node at the deepest level is in better than <code>O(N</code>)?
  What if the tree is a <code>binary search tree (right-&gt;data &gt; parent-&gt;data, left-&gt;data &lt; parent-&gt;data)</code>instead of a binary tree?</p>
  
  <p>I can get there using a breadth-first approach which gets the job done in O(N) for both the binary tree and binary search tree but wanted to know if there was a better approach.</p>