/* Driver program to test above functions*/
int main()
{
/* 6
/ \
10 2
/ \ / \
1 3 7 12
10 and 2 are swapped
*/
struct node *root = newNode(6);
root->left = newNode(10);
root->right = newNode(2);
root->left->left = newNode(1);
root->left->right = newNode(3);
root->right->right = newNode(12);
root->right->left = newNode(7);
printf("Inorder Traversal of the original tree \n");
printInorder(root);
correctBST(root);
printf("\nInorder Traversal of the fixed tree \n");
printInorder(root);
return 0;
}
int main()
{
struct BT *root = newnode(6);
root->l = newnode(10);
root->r = newnode(2);
root->l->l = newnode(1);
root->l -> r = newnode(3);
root->r->r = newnode(12);
root->r -> l =newnode(7);
printf(" BST Before correction :: \n");
printinorder(root);
correctBST(root);
printf(" BST after correction :: \n");
printinorder(root);
}
