anyView6.33③

6.33③  假定用两个一维数组L[1..n]和R[1..n]作为
有n个结点的二叉树的存储结构， L[i]和R[i]分别指
示结点i的左孩子和右孩子，0表示空。试写一个算法
判别结点u是否为结点v的子孙。

要求实现以下函数：
Status Dencendant(Array1D L,Array1D R,int n,int u,int v);
/* If node 'u' is the dencendant of node 'v', */
/* then return 'TRUE' else return 'FALSE'.    */
/* L[i] is the left child of the i_th node,   */
/* R[i] is the right child of the i_th node   */
/* in the Binary Tree which has n nodes.      */

一维数组类型Array1D的定义：

typedef int Array1D[MAXSIZE];

Status Dencendant(Array1D L,Array1D R,int n,int u,int v)
/* If node 'u' is the dencendant of node 'v', */
/* then return 'TRUE' else return 'FALSE'.    */
/* L[i] is the left child of the i_th node,   */
/* R[i] is the right child of the i_th node   */
/* in the Binary Tree which has n nodes.      */
{
 if(v<=n&&(L[v]==u||R[v]==u))return TRUE;
  if(L[v]==0&&R[v]==0)return FALSE;
  if(L[v])
  if(Dencendant(L,R,n,u,L[v]))return TRUE;
  if(R[v])
  return Dencendant(L,R,n,u,R[v]);
}