DSA/Binarytree.cpp at master · sudarshanpendhari/DSA · 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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include<iostream>
using namespace std;
class node
{	public:
	int data;
	node *left,*right;
};

class BTree
{	public:


	node* createTree()
	{
		int x;
		node *root;
		cin>>x;
		if(x==-1)
		{	return NULL;}
		root=new node();
		root->data=x;
		root->left=createTree();
		root->right=createTree();
		return root;
	}
	void inorder(node *root){
		if(root==NULL)
			return ;
		inorder(root->left);
		cout<<root->data;
		inorder(root->right);

	}

	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;

	}
};

int main()
{
	node *root;
	BTree T;
	root=T.createTree();
	T.inorder(root);


return 0;}