Out put for this code by DSA IN travesing
#include <iostream>
using namespace std;
struct Node {
int data;
Node* left;
Node* right;
};
Node* newNode(int data) {
Node* temp = new Node;
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
void preorder(Node* root) {
if (root != NULL) {
cout << root->data << " ";
preorder(root->left);
preorder(root->right);
}
}
void inorder(Node* root) {
if (root != NULL) {
inorder(root->left);
cout << root->data << " ";
inorder(root->right);
}
}
void postorder(Node* root) {
if (root != NULL) {
postorder(root->left);
postorder(root->right);
cout << root->data << " ";
}
}
int main() {
Node* root = newNode(10);
root->left = newNode(6);
root->right = newNode(15);
root->left->left = newNode(4);
root->left->right = newNode(8);
root->right->left = newNode(14);
root->right->right = newNode(18);
root->left->right->left = newNode(7);
root->left->left->right = newNode(11);
root->right->left->left= newNode(12);
root->right->left->right = newNode(13);
root->right->right->left = newNode(16);
root->right->right->right = newNode(19);
root->right->left->right = newNode(17);
cout << "Preorder traversal: ";
preorder(root);
cout << endl;
cout << "Inorder traversal: ";
inorder(root);
cout << endl;
cout << "Postorder traversal: ";
postorder(root);
cout << endl;
return 0;
}
Preorder traversal: 10 6 4 11 8 7 15 14 12 13 17 16 18 19
Inorder traversal: 4 11 6 7 8 10 12 14 13 17 15 16 18 19
Postorder traversal: 11 4 7 8 6 12 13 17 16 19 18 15 10