Leetcode 700. Search in a Binary Search Tree

小白菜又菜

于 2024-09-01 11:32:18 发布

阅读量348

点赞数 3

分类专栏： Leetcode 入门题初级DS 文章标签： leetcode python 算法

本文链接：https://blog.youkuaiyun.com/mobius_strip/article/details/141781990

版权

Problem

You are given the root of a binary search tree (BST) and an integer val.

Find the node in the BST that the node’s value equals val and return the subtree rooted with that node. If such a node does not exist, return null.

Algorithm

Just follow the definition.

Code

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

最低0.47元/天解锁文章