//Binary Tree Traversal - Preorder, Inorder, Postorder // #include using namespace std; struct Node { int data; Node *left; Node *right; }; //Preorder Funcation void Preorder(struct Node *root) { if (root == NULL) return; // if tree/sub-tree is empty, return and exit cout << root->data; // Visit Preorder(root->left); // Move left Preorder(root->right); // move right } //Inorder Funcation void Inorder(Node *root) { if (root == NULL) return; // if tree/sub-tree is empty, return and exit Inorder(root->left); //Move left cout << root->data; //Visit Inorder(root->right); // move right } //Postorder Funcation void Postorder(Node *root) { if (root == NULL) return; // if tree/sub-tree is empty, return and exit Postorder(root->left); // Move left Postorder(root->right); // move right cout << root->data; // Visit } // Function to Insert Node in a Binary Search Tree Node* Insert(Node *root, int data) { if (root == NULL) { root = new Node(); root->data = data; root->left = root->right = NULL; } else if (data <= root->data) root->left = Insert(root->left, data); else root->right = Insert(root->right, data); return root; } int main() { Node *root = NULL; root = Insert(root, '50'); root = Insert(root, '75'); root = Insert(root, '25'); root = Insert(root, '15'); root = Insert(root, '60'); root = Insert(root, '35'); root = Insert(root, '90'); root = Insert(root, '42'); root = Insert(root, '20'); root = Insert(root, '27'); root = Insert(root, '5'); root = Insert(root, '55'); root = Insert(root, '95'); root = Insert(root, '80'); root = Insert(root, '70'); cout << "Preorder: "; //Diaplay Nodes in Preorder. Preorder(root); cout << "\n"; cout << "Inorder: "; //Display Nodes in Inorder Inorder(root); cout << "\n"; cout << "Postorder: "; //Display Nodes in Postorder Postorder(root); cout << "\n"; return 0; }