data-structures-and-algorithms/Tree.cpp at main · Open-code-source/data-structures-and-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <iostream>
using namespace  std;

class Node{

public:
	int data;
	Node *left,*right;

	Node(int val){
		data=val;
		left=right=NULL;
	}
};
void print(Node *root){

	if(root==NULL){
		return;
	}
		print(root->left);
		cout<<root->data <<" ";
		print(root->right);
	}


int main(){

	Node *root=new Node(6);


	root->left             = new Node(2);
    root->right         = new Node(3);
    root->left->left     = new Node(4);
    root->left->right = new Node(5);

    cout << "\nInorder traversal of binary tree is \n";

    print(root);
    cout<<endl;


}