2、V01dAC(List&L)InitList(L);InsertRear (L;25);InsertFront(L, 50);IntaL4 = (5, 8, 12, 15, 36;for(inti=0; idata=X)return 1: / / 根结点的层号为 1/ /向子树中查找x结点else(int cl=NodeLevel (BT 一left, X):if(cl = l)return cl + 1;int c2=;if;/ /若树中不存在X结点则返回。else return 0;2、从一维数组An)中二分查找关键字为K的元素的递归算法,若查找成功则返 回对应元素的下标,否则返回一 1。IntBinsch(ElemTypeA, Intlow, int high, KeyTypeK)(if (low = high)(int mid= (low+high) / 2;if (K=Amid. key);else if (K 3 x 2. 456 一*十