1. If root is null, return null.
2. Else, create a Queue object that can store tree nodes.
3. Enqueue the root.
4. Run a loop till the Queue becomes empty.
5. Within the loop, dequeue a node and compare its value with the input value.
6. If the data matches, break out of the loop, else insert its left and right nodes into the Queue.
7. Return the node, if match is found, else return null.
