* if current nodes is a half node with right child NULL right , then it 's right  * child is returned and replaces it in the given tree
if ( node . right == null ) { new_root = node . left ; return new_root ; } return node ; }