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

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 700. Search in a Binary Search Tree，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1081字，纯文字阅读大概需要2分钟。

内容图文

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.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def searchBST(self, root, val):
        """
        :type root: TreeNode
        :type val: int
        :rtype: TreeNode
        """
        
        if root:
            def findsubtree(r,value):
                if not r:
                    return None
                elif r.val==value:
                    return r
                else:
                    a=findsubtree(r.left,value)
                    if not a:
                        b=findsubtree(r.right,value)
                        return b
                    return a
            
            return findsubtree(root,val)
        
        return []

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 700. Search in a Binary Search Tree全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 700. Search in a Binary Search Tree所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端