Search in a Binary Search Tree
二叉搜索树, 搜索一个值
|
1 2 3 4 5 6 7 8 9 10 11 12 |
class Solution { public TreeNode searchBST(TreeNode root, int val) { if(root == null) return null; if(root.val == val) return root; else if(root.val > val) return searchBST(root.left, val); else return searchBST(root.right, val); } } |