git_pro/binary_tree.txt at master · jsanyam/git_pro · 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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
import java.util.*;
import java.lang.*;

class Node
{
	protected int data;
	protected Node right;
	protected Node left;

	public Node()
	{
		data = 0;
		right = null;
		left = null;
	}

	public void setData(int data)
	{
		this.data = data;
	}

	public void setLeftLink(Node link)
	{
		left = link;
	}

	public void setRightLink(Node link)
	{
		right = link;
	}

	public int getData()
	{
		return data;
	}

	public Node getLeftLink()
	{
		return left;
	}

	public Node getRightLink()
	{
		return right;
	}

}

class LinkedList
{
	protected Node start;
	protected Node end;
	public int size;

	public LinkedList()
	{
		start = null;
		end = null;
		//size = 0;
	}

	public void addItem(int item)
	{
		Node temp = new Node();
		Node t = start;
		temp.setData(item);
		if(start == null)
		{
			start = temp;
			end = start;
		}
		else
		{
			while(t != null)
			{
				if(item < t.getData())
				{
					if(t.getLeftLink() == null)
					{
						t.setLeftLink(temp);
						break;
					}
					t = t.getLeftLink();
				}
				else
				{
					if(t.getRightLink() == null)
						{
							t.setRightLink(temp);
							break;
						}
						t = t.getRightLink();
				}
			}
		}
	}

	public void preOrder(Node head)
	{
		Node t = head;
		if(t != null)
		{
			System.out.print(t.getData()+" ");
			preOrder(t.getLeftLink());
			preOrder(t.getRightLink());
		}
	}
	public void inOrder(Node head)
	{
		Node t = head;
		if(t != null)
		{
			preOrder(t.getLeftLink());
			System.out.print(t.getData()+" ");
			preOrder(t.getRightLink());
		}
	}
	public void postOrder(Node head)
	{
		Node t = head;
		if(t != null)
		{
			preOrder(t.getLeftLink());
			preOrder(t.getRightLink());
			System.out.print(t.getData()+" ");
		}
	}

	public void display()
	{
		System.out.print("PreOrder traversal:");
		preOrder(start);
		System.out.print("\nInOrder traversal:");
		inOrder(start);
		System.out.print("\nPostOrder traversal:");
		postOrder(start);
	}
	public int getHeight(Node head)
	{
		Node t = head;
		if(t == null)
			return 0;
		else
		{
			return 1+Math.max(getHeight(t.getLeftLink()),getHeight(t.getRightLink()));
		}
	}

	public void height()
	{
		System.out.println(getHeight(start));
	}
}


public class cross
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner val = new Scanner(System.in);
		LinkedList list = new LinkedList();
		System.out.println("Enter the value of n: ");
		int n = val.nextInt();
		System.out.println("Enter value:");
		for(int i = 0; i < n; i++)
		{
			int item = val.nextInt();
			list.addItem(item);
		}
		list.display();
		System.out.println("Height of the tree:");
		list.height();
		System.out.print("\nTHE END");
	}
}