int main() { struct tNode *root = newNode(1); root->left = newNode(2); root->right = newNode(3); root->left->left = newNode(4); root->left->right = newNode(5); MorrisTraversal(root); return 0; }
int main(void) { struct Node *root=0; int i; for(i=0;i<5*5*5;++i) { Insert(&root,i*7*7*7%(5*5*5)); } // Recursive InOrder Traversal printf("Traversal:"); PrintTree(root); printf("\n"); // InOrder with Lindstrom Traversal printf("Traversal:"); MorrisTraversal(root); printf("\n"); DeleteTree(root); return 0; }
/* Driver program to test above functions*/ int main() { /* Constructed binary tree is 1 / 2 \ 3 */ struct tNode *root = newtNode(1); root->left = newtNode(2); root->left->right = newtNode(3); MorrisTraversal(root); getchar(); return 0; }