412413414415416417418419420421422
ll = ll+1; } assert ll > 0; assert a != b; WhichNode eli = goHigherNode(a,b); for( int j=0; j<n; ++j ) { // node to eliminate is the one located higher in the tree (for distance = 1 this is parent node) if(eli==WhichNode.NODE1)