zoukankan      html  css  js  c++  java
  • 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
            
    

      

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    Git工作原理
    将博客搬至CSDN
    Hive常见文件存储格式
    Hadoop进入安全模式源码分析
    Hadoop RPC简介
    hive自定义UDF函数
    hive性能调优之表设计层面调优
    flowable 启用慢 且启动不起来 报错看不懂
    数据结构和算法基础
    css: 边宽弧度
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10011498.html
Copyright © 2011-2022 走看看