bt= NUlL for (i=1; i<=n; i++) p=( Bin Sort Tree Node ")malloc(sizeof (Bin Sort Tree Node)); p->key =ai. key; p->otheritem=ali. otheritem p->Chile= null p->chile= NUll bt inserti(&bt, p) return(bt); 请单赤鼠标左键换页!bt = NULL ; for ( i =1; i <= n;i++) { p = (Bin_Sort_Tree_Node *)malloc (sizeof (Bin_Sort_Tree_Node)); p ->key =a[i].key; p -> otheritem= a[i].otheritem;; p -> lchile = NULL; p -> rchile = NULL; bt_insert1( &bt , p); } return ( bt) ; }