Implement a method to find a node from a given binary search tree

Example: 4 / \ 2 8 / \ 5 10 find(10) ==> 10

Need a **hand?** Try out these hints, one at a time.

The key here is to traverse through the nodes of the tree and return the one which has the data same as the input data.

1. If the `root`

data is null, `return null`

.

2. If data to be searched is less than `root`

data then recurse through the left nodes. i.e. `return find(root.left, data)`

3. If data is greater than the `root`

node then recurse through the right nodes. i.e. `return return find(root.right, data)`

4. Else, return the `root`

node itself.

public TreeNode find(TreeNode root, int data) { }

**C**

**Java**

**Python**