/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
if(root == null || root.val == val){
return root;
}
TreeNode result = null;
if(root.val > val) result = searchBST(root.left,val);
if(root.val < val) result = searchBST(root.right,val);
return result;
}
}
代码随想录——700. 二叉搜索树中的搜索
最新推荐文章于 2024-10-01 04:50:10 发布