title: BST, finding next highest node
body: <p>In BST, according to Programming Interviews Exposed</p>
  
  <p>"Given a node, you can even find the next highest node in O(log(n)) time" Pg 65</p>
  
  <p>A node in BST has right child as the next highest node, then why O(log(n))? Please correct</p>
  
  <p>First answer the question, then negate it</p>