Question 3 (Binary search tree implementations) class Node ( int data; Node left; Node right; public Node (int data)( this.data data; left null; right null; public class BinarySearchTree public static Node root; public BinarySearchTree)f this.root null; Write the code for the method find public boolean find (int id)