[LeetCode&Python] Problem 700. Search in a Binary Search Tree
Posted chiyeung
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode&Python] Problem 700. 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
.
# 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的主要内容,如果未能解决你的问题,请参考以下文章
C++&Python描述 LeetCode C++&Python描述 LeetCode 剑指 Offer 22. 链表中倒数第k个节点
[LeetCode&Python] Problem 202. Happy Number
[LeetCode&Python] Problem 520. Detect Capital
[LeetCode&Python] Problem 383. Ransom Note