Search in a Binary Search Tree

Posted ruruozhenhao

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Search in a Binary Search Tree相关的知识,希望对你有一定的参考价值。

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.

 

Approach #1: C++.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        while (root != nullptr && root->val != val) {
            root = (root->val > val) ? root->left : root->right;
        }
        return root;
    }
};

  

Approach #2: Java.

/**
 * 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 || root.val == val) return root;
        return root.val > val ? searchBST(root.left, val) : searchBST(root.right, val);
    }
}

  

Approach #3: Python.

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def searchBST(self, root, val):
        """
        :type root: TreeNode
        :type val: int
        :rtype: TreeNode
        """
        if root and root.val > val:
            return self.searchBST(root.left, val)
        if root and root.val < val:
            return self.searchBST(root.right, val)
        return root
        

  

 

以上是关于Search in a Binary Search Tree的主要内容,如果未能解决你的问题,请参考以下文章

[Leetcode]700. Search in a Binary Search Tree

700. Search in a Binary Search Tree

[LeetCode&Python] Problem 700. Search in a Binary Search Tree

LeetCode 700 Search in a Binary Search Tree 解题报告

Jan 23 - Search In Rotated Array II; Array; Binary Search;

LeetCode | 0700. Search in a Binary Search Tree二叉搜索树中的搜索Python