Trim Binary Search Tree

Problem Statement: http://www.ardendertat.com/2012/01/17/programming-interview-questions-26-trim-binary-search-tree/

      6
     / \
    2   7
   / \
  1  4
    / \
   3   5

  [3, 6]

Time Complexity: O(N)
Space Complexity: O(1)