http://grimore.i2p/secondlife/binary_trees/binary_search_trees/insert
= 0 ) { if ( fa > fb ) return 1 ; if ( fa < fb ) return - 1 ; return 0 ; } // lexical if ( llStringLength ( chra ) == 0 && llStringLength ( chrb ) == 0 ) return 0 ; if ( llStringLength ( chra ) && llStringLength ( chrb ) == 0 ) return 1 ; if ( llStringLength ( chra ) == 0 && llStringLength ( chrb ) ) return - 1 ; string a = llGetSubString ( chra, 0 , 0 ) ;
chra = llDeleteSubString ( chra, 0 , 0 ) ; string b = llGetSubString ( chrb, 0 , 0 ) ;
chrb = llDeleteSubString ( chrb, 0 , 0 ) ; integer oa =...