How do I find the nth ancestor of a node in a binary search tree?
I got asked this at a job interview.  Here's my `O(log n)` solution. 

Find the depth of the node.
Repeat the search, but stop at `depth - n`.

Is there a way to do this without the second pass?
How do I find the nth ancestor of a node in a binary search tree?
===

I got asked this at a job interview.  Here's my `O(log n)` solution. 

Find the depth of the node.
Repeat the search, but stop at `depth - n`.

Is there a way to do this without the second pass?