-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree.java
67 lines (56 loc) · 1.42 KB
/
BinaryTree.java
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
class BinaryTree
{
// Root of Binary Tree
Node root;
BinaryTree()
{
root = null;
}
// Constructors
BinaryTree(int key)
{
root = new Node(key);
}
static class Node
{
int key;
Node left, right;
public Node(int item)
{
key = item;
left = right = null;
}
}
public static void preOrderTraversal(Node node) {
if (node == null)
return;
System.out.print(node.key + " ");
preOrderTraversal(node.left);
preOrderTraversal(node.right);
}
public static void inOrderTraversal(Node node) {
if (node == null)
return;
preOrderTraversal(node.left);
System.out.print(node.key + " ");
preOrderTraversal(node.right);
}
public static void postOrderTraversal(Node node) {
if (node == null)
return;
preOrderTraversal(node.left);
preOrderTraversal(node.right);
System.out.print(node.key + " ");
}
public static void main(String[] args)
{
BinaryTree tree = new BinaryTree();
/*create root*/
tree.root = new Node(1);
tree.root.left = new Node(2);
tree.root.right = new Node(3);
tree.root.left.left = new Node(4);
// preOrderTraversal(tree.root);
// Output : 1 2 4 3
}
}