boolean hasChild ( ) { boolean has = false ; if ( ( leftChild ( ) != null ) || ( rightChild ( ) != null ) ) has = true ; return has ; }
Return true if the node has either a right child or a left child .