void SetRoot(Tree *T, char value, boolean B )
/* I.S T sembarang */
/* F.S Root dari Tree (Node pertama) terdefinisi memiliki infoNode = value dan mark = B */
{ /* Kamus Lokal */
pNode P;
/* Algoritma */
if(IsEmptyTree(*T))
{
P = AlokasiNode(value, B);
*T = P;
}
else
{
info(**T) = value;
mark(**T) = B;
}
}
/* Node Deletion Of Binary Tree */
int Delete(tree **root,int data)
{
tree *t1,*t2;
if(IsEmptyTree(*root)){
printf("Tree Empty !\n");
return 0;
}
t1=findNode(root,data);
t2=depthOfTree(root);
if(t1 == NULL){
printf("Not Exist Node : %d\n",data);
return 0;
}
t1->data=t2->data;
t1=t2;
free(t2);
return data;
}
