Search In a Binary Search Tree 🌳| Daily LeetCode Challenge | Day 14 | Coding Interview
2 min readApr 14, 2022
This is the 14th problem of the challenge and it's just a simple BST traversal.
Description
We are given a BST and an integer, we have to find the value in the BST and return the root of the subtree holding the node with the passed value. Return null if the passed value does not exist.
