TREE

#include <iostream>
using namespace std;

class Node {
public:
int data;
Node* left;
Node* right;

Node(int value) {
data = value;
left = nullptr;
right = nullptr;
}
};

void preOrder(Node* root) {

if (root == NULL)
return;

cout << root->data<< " ";

preOrder(root->left);
preOrder(root->right);
}

void postOrder(Node* root) {

if (root == NULL)
return;

postOrder(root->left);
postOrder(root->right);
cout << root->data << " ";
}

void inOrder(Node* root) {

if (root == NULL)
return;

inOrder(root->left);
cout << root->data << " ";
inOrder(root->right);

int main() {

Node NodeA(1);
Node NodeB(2);
Node NodeC(3);
Node NodeD(4);
Node NodeE(5);
Node NodeF(6);
Node NodeG(7);

NodeA.left = &NodeB;
NodeA.right = &NodeC;
 NodeB.left = &NodeD;
NodeB.right = &NodeE;

NodeC.left = &NodeF;
NodeC.right = &NodeG;

//cout << NodeA.left->data<< ' ';

//cout << NodeA.right->data;

inOrder(&NodeA);
}