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