[LeetCode&Python] Problem 700. Search in a Binary Search Tree
2021-05-16 18:30
标签：this ini value expec represent root class exist nod 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, You should return this subtree: In the example above, if we want to search the value Note that an empty tree is represented by [LeetCode&Python] Problem 700. Search in a Binary Search Tree 标签：this ini value expec represent root class exist nod 原文地址：https://www.cnblogs.com/chiyeung/p/9748660.htmlGiven the tree:
4
/ 2 7
/ 1 3
And the value to search: 2
2
/ \
1 3
5, since there is no node with value 5, we should return NULL.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
文章链接：http://soscw.com/index.php/essay/86374.html