main() { struct node* head = NULL; head =insert(head,3); head = insert(head,4); head = insert(head,2); head = insert(head,6); head = insert(head,1); printpostorder(head); printf("\n"); }
int main(){ struct node *root1 = newnode(1); struct node *root2 = newnode(1); root1->left = newnode(2); root1->right = newnode(3); root1->left->left = newnode(4); root1->left->right = newnode(5); root2->left = newnode(2); root2->right = newnode(3); root2->left->left = newnode(4); root2->left->right = newnode(5); if(identical(root1, root2)) printf("Both tree are identical."); else printf("Trees are not identical."); printpostorder(root1); printf("%s", "\n"); return 0; }
void printpostorder(node* nod){ if(nod == NULL)return; printpostorder(nod->right); printpostorder(nod->left); printf("%d", nod->data); }