JavaPracticeHacks/BinaryTreeNode.java at master · divekarsc/JavaPracticeHacks · 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
package trees;

import java.util.LinkedList;
import java.util.Queue;


public class BinaryTreeNode {

	private int data;
	private BinaryTreeNode left;
	private BinaryTreeNode right;
	public int getData() {
		return data;
	}
	public void setData(int data) {
		this.data = data;
	}
	public BinaryTreeNode getLeft() {
		return left;
	}
	public void setLeft(BinaryTreeNode left) {
		this.left = left;
	}
	public BinaryTreeNode getRight() {
		return right;
	}
	public void setRight(BinaryTreeNode right) {
		this.right = right;
	}


	void levelOrderTraversal(BinaryTreeNode root)
	{
		BinaryTreeNode temp=null;
		Queue<BinaryTreeNode> q= new LinkedList<BinaryTreeNode>();
		if(root==null)
			return;
		q.add(root);
		while(!q.isEmpty())
		{
			temp=(BinaryTreeNode) q.poll();
			System.out.println(temp.getData());
			if(temp.getLeft()!= null)
				q.add(temp.getLeft());
			if(temp.getRight()==null)
				q.add(temp.getRight());
		}

	}

	void PreOrder(BinaryTreeNode root)
	{
		if(root!= null)
		{
			System.out.println(root.getData());
			PreOrder(root.getLeft());
			PreOrder(root.getRight());
		}
	}

	void PostOrder(BinaryTreeNode root)
	{
		if(root!=null)
		{
			PostOrder(root.getLeft());
			PostOrder(root.getRight());
			System.out.println(root.getData());
		}
	}


	void inOrder(BinaryTreeNode root)
	{
		if(root!=null)
		{
			inOrder(root.getLeft());
			System.out.println(root.getData());
			inOrder(root.getRight());

		}
	}
}