inserting keys in tst in the order middle , small , big lexicographic measure recursively creates a balanced tree which reduces insertion and search times significantly . concode_field_sep PlaceHolder placeHolder concode_field_sep ArrayList<TernaryTreeNode> prefixCompletion concode_elem_sep TernaryTreeNode insert
void function ( Object [ ] arg0 , Object [ ] arg1 , int arg2 , int arg3 , TernaryTreeNode arg4 ) { if ( arg2 > arg3 ) return ; int loc0 = ( arg2 + arg3 ) / 2 ; arg4 = insert ( arg4 , ( String ) arg0 [ loc0 ] , arg1 [ loc0 ] , 0 ) ; balancedTree ( arg0 , arg1 , arg2 , loc0 - 1 , arg4 ) ; balancedTree ( arg0 , arg1 , loc0 + 1 , arg3 , arg4 ) ; }