700. Search in a Binary Search Tree
程序员文章站
2022-06-08 09:20:36
...
Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Return the subtree rooted with that node. If such node doesn't exist, you should return NULL.
For example,
Given the tree: 4 / \ 2 7 / \ 1 3 And the value to search: 2
You should return this subtree:
2 / \ 1 3
In the example above, if we want to search the value 5
, since there is no node with value 5
, we should return NULL
.
Note that an empty tree is represented by NULL
, therefore you would see the expected output (serialized tree format) as []
, not null
.
二叉树查找,程序如下所示:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
if (root == null){
return root;
}
if (root.val == val){
return root;
}
if (val >= root.val){
return searchBST(root.right, val);
}
return searchBST(root.left, val);
}
}
上一篇: php字符串截取函数
推荐阅读
-
荐 Java刷题笔记15:不同的二叉搜索树( Unique Binary Search Trees)
-
Convert Sorted Array to Binary Search Tree
-
二分查找(binary search)java实现及时间复杂度
-
【leetcode】-700. Search in a Binary Search Tree 查找二叉搜索树
-
LeetCode C++ 454. 4Sum II【Hash Table/Sort/Two Pointers/Binary Search】
-
Leetcode——108. Convert Sorted Array to Binary Search Tree
-
Leetcode 108. Convert Sorted Array to Binary Search Tree
-
96. Unique Binary Search Trees
-
POJ 1757 Binary Search G++
-
Binary Search:349. Intersection of Two Arrays