一、Leetcode 530. 二叉搜索树的最小绝对差 so easy, just take advantage of the BST property. 二、Leetcode 501. 二叉搜索树中的众数 as the same as the last question. 三、Leetcode 236. 二叉树的最近公共祖先 backtrack method. Just use postorder traversal method.