鏁版嵁緇撴瀯絎叚绔犲～絀洪鍙?qiáng)绛旀[16]_璺ㄨ€冪綉

1錛庡凡鐭ヤ腑搴忛亶鍘?/span>bt鎵€鎸囦簩鍙夋爲(wèi)綆楁硶濡備笅錛?/span>s涓哄瓨鍌ㄤ簩鍙夋爲(wèi)緇撶偣鎸囬拡鐨勫伐浣滄爤錛岃鍦ㄥ垝綰垮濉叆涓€鏉℃墍緙鴻鍙ャ€?/span>

銆€銆€PROC inorder (bt:bitreptr);

銆€銆€inistack(s); (1)_______;

銆€銆€WHILE NOT empty(s) DO

銆€銆€[WHILE gettop(s)<>NIL DO push(s,gettop(s)鈫?/span>.lchild); (2)_______;

銆€銆€IF NOT empty(s) THEN [visit (gettop(s)^); p:=pop(s); (3)_______ ] ]

銆€銆€ENDP;{inorder} 銆愬寳浜交宸ヤ笟瀛﹂櫌 1999 涓€銆?/span> (9鍒?/span>)銆?/span>

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

銆€銆€(1)push(s,bt) 錛?/span>2錛?/span>pop(s) 錛?/span>3錛?/span>push(s,p^.rchild) // p鐨勫彸瀛愭爲(wèi)榪涙爤

銆€銆€

銆€銆€2錛庝互涓嬬▼搴忔槸浜屽弶閾捐〃鏍?wèi)涓簭閬嶅巻鐨勯潪閫掑綊綆楁硶錛岃濉┖浣夸箣瀹屽杽銆備簩鍙夋爲(wèi)閾捐〃鐨勭粨鐐圭被鍨嬬殑瀹氫箟濡備笅錛?/span>

銆€銆€typedef struct node /*C璇█/

銆€銆€{char data; struct node *lchild,*rchild;}*bitree;

銆€銆€void vst(bitree bt) /*bt涓烘牴緇撶偣鐨勬寚閽?/span>*/

銆€銆€{ bitree p; p=bt; initstack(s); /*鍒濆鍖栨爤s涓虹┖鏍?/span>*/

銆€銆€while(p || !empty(s)) /*鏍?/span>s涓嶄負(fù)絀?/span>*/

銆€銆€if(p) { push (s,p); (1)___; } /*P鍏ユ爤*/

銆€銆€else { p=pop(s); printf(鈥?/span>%c鈥?/span>,p->data); (2)____; } /*鏍堥《鍏冪礌鍑烘爤*/

銆€銆€} 銆?a target="_blank">瑗垮崡浜ら€氬ぇ瀛?/a> 2000 涓€銆?/span>10銆?/span>

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

銆€銆€(1) p=p->lchild // 娌垮乏瀛愭爲(wèi)鍚戜笅 錛?/span>2錛?/span>p=p->rchild

銆€銆€

銆€3錛庝簩鍙夋爲(wèi)瀛樺偍緇撴瀯鍚屼笂棰橈紝浠ヤ笅紼嬪簭涓烘眰浜屽弶鏍?wèi)娣卞害鐨勯€掑綊綆楁硶錛岃濉┖瀹屽杽涔嬨€?/span>

銆€銆€int depth(bitree bt) /*bt涓烘牴緇撶偣鐨勬寚閽?/span>*/

銆€銆€{int hl,hr;

銆€銆€if (bt==NULL) return((1)___);

銆€銆€hl=depth(bt->lchild); hr=depth(bt->rchild);

銆€銆€if((2)___) (3)_____錛?/span>

銆€銆€return(hr+1);

銆€銆€} 銆?a target="_blank" class="keylink">瑗垮崡浜ら€氬ぇ瀛?/a> 2000 涓€銆?/span>11銆?/span>

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

銆€銆€(1)0 錛?/span>2錛?/span>hl>hr (3)hr=hl