Data-Structures/display_binary_tree.cpp at master · mohitarora3/Data-Structures · 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include<iostream>
#include<conio.h>
using namespace std;
class node
{
	int info;
	node *right;
	node *left;
	friend class binary;
	public:
		node()
		{
			right=0;
			left=0;
		}
		node(int ele,node *p=0,node *t=0)
		{
			info=ele;
			left=p;
			right=t;
		}

};

class binary
{

	node *root;
	int count;

	public:
	binary()
	{
		root=0;
		count=0;
	}
	void insert(int,node *);
	void display();
	node *ret_root(){
		return root;
	}

};
void binary::insert(int ele,node *r)
{
	if(r==0)
		{
			r=new node(ele);
			++count;
		}
	else if(ele>r->info)
			insert(ele,r->right);
	else if(ele<r->info)
			insert(ele,r->left);

}
void binary::display()
{
	if(root)
	{
	int i=0;
	node *a=new node[count];
	node *temp=root;
	a[i]=temp;
	while(i<count)
	{
		temp=a[i];
		cout<<a[i]->info<<" ";
		if(temp->left)
			a[++i]=temp->left;

		if(temp->right)
			a[++i]=temp->right;
	}

}
int main()
{
	binary b;
	int n;
	cout<<"\n\tEENTER SIZE:";
	cin>>n;
	for(int i=0;i<n;i++)
	{
		coin>>ele;
		b.insert(ele,b.ret_root());
	}
	b.display();
	getch();
}