public Node treeSearch(Node root, int key)
    {
        if (root == null)
        {
            return null;
        }
        if (key == root.getKey())
        {
            return root;
        }
        else if (key < root.getKey())
        {
            return treeSearch(root.getLeft(), key);
        }
        else
        {
            return treeSearch(root.getRight(), key);
        }
        
    }