Write a method removeRightmost which removes the rightmost Node from a tree and returns the resulting tree. 

Is it correct ? 

private Node removeRightmost (Node root) {

// IMPLEMENT

if(root.right == null)

return root.left;

else{

root.right = removeRightmost(root.right);

}

return root;

}