鏁版嵁緇撴瀯絎叚绔犵畻娉曡璁￠[19]_璺ㄨ€冪綉

1錛庡凡鐭ヤ簩鍙夋爲(wèi)T鐨勭粨鐐瑰湪鍏堟牴嬈″簭涓嬬殑鎺掑垪涓?/span>A[1]錛?/span>A[2]錛屸€︼紝A[n]錛屽湪涓牴嬈″簭涓嬬殑鎺掑垪涓?/span>B[1]錛?/span>B[2]錛屸€︼紝B[n]錛屽叾涓紝A鍜?/span>B鏄竴緇存暟緇勶紝鏁扮粍鍏冪礌鐨勫€間負(fù)T涓浉搴旂殑緇撶偣鐨?/span>INFO瀛楁鐨勫€鹼紝騫跺亣瀹氫簩鍙夋爲(wèi)T涓粨鐐圭殑INFO瀛楁鐨勫€間簰涓嶇浉鍚岋紝n>=0銆傝瘯瑙ｇ瓟錛?/span>

銆€銆€錛?/span>1錛夎瘉鏄庣敱A[1錛?/span>n]鍜?/span>B[1錛?/span>n]鑳藉敮涓€鐨勭‘瀹氫簩鍙夋爲(wèi)T鐨勭粨鏋勶紱

銆€銆€錛?/span>2錛夌粰鍑哄緩閫犱簩鍙夋爲(wèi)T鐨勭畻娉曪紝瑕佹眰鎵€寤洪€犵殑浜屽弶鏍?wèi)浠?/span>LLINK/RLINK閾炬帴緇撴瀯琛ㄧず錛屼笖璇ョ畻娉曟槸闈為€掑綊綆楁硶錛?/span>

銆€銆€錛?/span>3錛夊垎鏋愪綘鎵€緇欑畻娉曠殑鏃墮棿澶嶆潅鎬э紝璇ヨ繃紼嬪寘鎷浣曠‘瀹氬熀鏈繍綆楀浣曟帹瀵煎嚭鏈熸湜澶嶆潅鎬у拰鏈€鍧忓鏉傛€с€傘€?a target="_blank">鍚夋灄澶у 1997 鍥?/span> (20鍒?/span>) 1998 浜屻€?/span>

銆€銆€銆愬弬鑰冪瓟妗堛€?/span>

銆€銆€錛?/span>1錛夌敱鍏堝簭搴忓垪A[1..n]鍜屼腑搴忓簭鍒?/span>B[1..n],鍙互紜畾涓€媯典簩鍙夋爲(wèi),璇﹁鏈珷鍥涚38棰?/span>.

銆€銆€錛?/span>2錛?/span>void PreInCreat( ElemTypeA[],B[]錛?/span>int l1,h1,l2,h2)

銆€銆€//鐢變簩鍙夋爲(wèi)鍓嶅簭搴忓垪A[1..n]鍜屼腑搴忓簭鍒?/span>B[1..n]寤虹珛浜屽弶鏍?/span>,l1,h1,鍜?/span>l2,h2鍒嗗埆涓哄厛搴忓簭鍒楀拰

銆€銆€//涓簭搴忓垪絎竴鍜屾渶鍚庣粨鐐圭殑涓嬫爣.鍒濆璋冪敤鏃?/span>l1=l2=1,h1=h2=n 銆?/span>

銆€銆€{typedef struct {int l1,h1,l2,h2; BiTree t; }node;

銆€銆€BiTree bt;

銆€銆€int top=0,i; node s[],p; //s涓烘爤,瀹歸噺瓚沖澶?/span>

銆€銆€bt=(BiTree)malloc(sizeof(BiNode)); //鐢寵緇撶偣絀洪棿

銆€銆€p.l1=l1; p.h1=h1; p.l2=l2; p.h2=h2; p.t=bt; s[++top]=p; //鍒濆鍖?/span>

銆€銆€while(top>0)

銆€銆€{p=s[top--]; bt=p.t; l1=p.l1; h1=p.h1; l2=p.l2 ;h2=p.h2;//鍙栧嚭鏍堥《鏁版嵁

銆€銆€for(i=l2;i<=h2;i++) if(B[i]==A[l1]) break; //鍒頒腑搴忓簭鍒椾腑鏌ユ牴緇撶偣鐨勫€?/span>

銆€銆€bt->data=A[l1]; //A[l1]涓烘牴緇撶偣鐨勫€?/span>

銆€銆€if(i==l2) bt->lchild=null; //bt鏃犲乏瀛愭爲(wèi)

銆€銆€else //灝嗗緩绔嬪乏瀛愭爲(wèi)鐨勬暟鎹叆鏍?/span>

銆€銆€{bt->lchild=(BiTree)malloc(sizeof(BiNode)); p.t=bt->lchild;

銆€銆€p.l1=l1+1; p.h1=l1+i-l2; p.l2=l2; p.h2=i-1; s[++top]=p; }

銆€銆€if(i==h2) bt->rchild=null; //bt鏃犲彸瀛愭爲(wèi)

銆€銆€else {bt->rchild=(BiTree)malloc(sizeof(BiNode)); p.t=bt->rchild;

銆€銆€p.l1=l1+i-l2+1; p.h1=h1; p.l2=i+1; p.h2=h2; s[++top]=p; }//鍙沖瓙鏍?wèi)鏁版嵁鍏ユ?/span>

銆€銆€}//while

銆€銆€}緇撴潫PreInCreat

銆€銆€(3)褰撲簩鍙夋爲(wèi)涓哄崟鏀爲(wèi)鏃訛紝鏍堟繁n錛涳紝褰撲簩鍙夋爲(wèi)宸﹀彸瀛愭爲(wèi)楂樼浉絳夋椂錛屾爤娣?/span>logn銆傛椂闂村鏉傚害O(n)銆?/span>