- Know BST’s left subtree vals are smaller than root node val.
You are given the
root of a binary search tree (
BST) and an integer
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
Input: root = [4,2,7,1,3], val = 2