求结点在二叉排序树中层次的算法

 int lev=0;
 6 void level(bitree *bt,int x)
 7 {
 8     if(bt!=null){ 
 9         lev++;
10         if(bt->key==x) return; 
11         else if(bt->key>x) level(bt->lchild,x); 
12         else level(bt->rchild,x);
13     }
14 }

标签：结点,key,level,int,二叉,bt,lev,else,树中
来源： https://blog.csdn.net/qq_45560230/article/details/121164956