Search Root Element in Binary Search Tree.

[Heet-Patel-5304]

Description

The provided code defines a method for searching a value in a binary search tree (BST). It utilizes a recursive approach to traverse the tree. The TreeNode class represents a node in the tree, containing an integer value and references to left and right child nodes. The searchBST method takes the root of the tree and the value to be searched as inputs and returns the node containing the value if found; otherwise, it returns null.

Explanation

1. Class Definition:

• The TreeNode class defines the structure of a node in the binary search tree. It has three constructors: a default constructor, one that initializes the node with a value, and another that initializes the node with a value and its left and right children.

2. Search Method (searchBST):

1. Parameters:

• TreeNode root: The root node of the BST.
• int val: The value to search for.

2. Base Case:

• If the root is null, it means the value is not found, and it returns null.

3. Value Check:

• If the value of the current node (root.val) matches val, the method returns the current node.

4. Recursive Search:

• If root.val is greater than val, the method recursively searches the left subtree.
• If root.val is less than val, it recursively searches the right subtree.