Description: 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. */
To Search:
File list (Check if you may need any files):
Tree.txt
Download