鏁版嵁緇撴瀯絎節(jié)绔犲～絀洪鍙?qiáng)鍙傝€冪瓟妗圼9]_璺ㄨ€冪綉

1錛庡亣璁?/span>root鏄竴媯電粰瀹氱殑闈炵┖鏌ユ壘鏍?wèi)锛屽浜庝笅闈⒕l欏嚭鐨勫瓙紼嬪簭錛屽綋鎵ц娉ㄩ噴涓粰鍑虹殑璋冪敤璇彞鏃訛紝灝卞彲浠ュ疄鐜板涓嬬殑鎿嶄綔錛氬湪闈炵┖鏌ユ壘鏍?/span>root涓煡鎵懼€間負(fù)k 鐨勭粨鐐癸紱鑻ュ€間負(fù)k鐨勭粨鐐瑰湪鏍?wèi)涓Q屼笖鏄竴涓彾瀛愮粨鐐癸紝鍒欏垹闄ゆ鍙跺瓙緇撶偣錛屽悓鏃剁疆success

銆€銆€涓衡€滅湡鈥濓紱鑻ュ€間負(fù)k鐨勭粨鐐逛笉鍦ㄦ爲(wèi)涓紝鎴栬€呰櫧鐒跺湪鏍?wèi)涓Q屼絾涓嶆槸鍙跺瓙緇撶偣錛屽垯涓嶈繘琛屽垹闄わ紝浠呯疆success涓衡€滃亣鈥濄€傚簲娉ㄦ剰鍒伴潪絀烘煡鎵炬爲(wèi)鍙寘鍚竴涓粨鐐規(guī)儏鍐碉紝姝ゆ椂鏍?wèi)涓殑鍞竴緇撶偣錛屾棦鏄牴緇撶偣錛屼篃鏄彾瀛愮粨鐐廣€?/span>

銆€銆€#include <stdio.h>

銆€銆€typedef struct node {

銆€銆€int key;

銆€銆€struct node *left錛?/span> *right;

銆€銆€} node;

銆€銆€node *root; int k錛?/span>success;

銆€銆€void del_leaf(node **t, int k, int *sn)

銆€銆€{ node *p, *pf; p=*t; *sn=0;

銆€銆€while(_錛?/span>1錛?/span>_&&!*sn)

銆€銆€if (k==p->key) *sn =1;

銆€銆€else { _錛?/span>2錛?/span>_;

銆€銆€if (k<p->key ) p=p->left; else p=p->right; }

銆€銆€if (*sn && p->left==NULL && p->right==null)

銆€銆€{ if (_錛?/span>3錛?/span>_ )

銆€銆€if (pf->left ==p ) pf ->left=null; else pf->right=null;

銆€銆€else _錛?/span>4錛?/span>_ ;

銆€銆€free(p); }

銆€銆€else *sn=0;

銆€銆€/*call form :del_leaf( &root, k, &success);*/ 銆?a target="_blank">涓婃搗澶у 1999 涓€銆?/span>2 錛?/span>8鍒嗭級(jí)銆?/span>

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

銆€銆€(1)p!=null (2)pf=p (3)p!=*t (4)*t=null