Package g0601_0700.s0700_search_in_a_binary_search_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    700 - Search in a Binary Search Tree\.

    Easy

    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.

    Example 1:

    Input: root = 4,2,7,1,3, val = 2

    Output: 2,1,3

    Example 2:

    Input: root = 4,2,7,1,3, val = 5

    Output: []

    Constraints:

    • The number of nodes in the tree is in the range [1, 5000].

    • <code>1 <= Node.val <= 10<sup>7</sup></code>

    • root is a binary search tree.

    • <code>1 <= val <= 10<sup>7</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final TreeNode searchBST(TreeNode root, Integer val)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait