#include<stdio.h>
int L[6+1]={0,2,4,0,6,0,0};
int R[6+1]={0,3,5,0,0,0,6};
int n=6;
int IfSon(int u,int v)
{
if(u&&v){
if(L[v]==u||R[v]==u)
return 1;
else
return(IfSon(u,L[v])||IfSon(u,R[v]));
}
return 0;
}
int main()
{
printf("%d\n",IfSon(5,1));
}
6_33_两个一维数组判断u是否为v的子孙
最新推荐文章于 2016-03-04 22:34:00 发布