forked from AllAlgorithms/java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryTree.java
More file actions
89 lines (75 loc) · 1.87 KB
/
BinaryTree.java
File metadata and controls
89 lines (75 loc) · 1.87 KB
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
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author miqdad
*/
class Node {
Node left, right;
int value;
public Node(int value) {
this.value = value;
}
public Node search(int value) {
if (this.value == value) {
return this;
} else if (value < this.value && this.left != null) {
this.left.search(value);
} else if (value > this.value && this.right != null) {
this.right.search(value);
}
return null;
}
private void visit() {
if (this.left != null) {
this.left.visit();
}
System.out.print(this.value + " ");
if (this.right != null) {
this.right.visit();
}
}
private void addNode(Node node) {
if (node.value < this.value) {
if (this.left == null) {
this.left = node;
} else {
this.left.addNode(node);
}
} else {
if (this.right == null) {
this.right = node;
} else {
this.right.addNode(node);
}
}
}
}
class Tree {
Node root;
private void addValue(int value) {
Node node = new Node(value);
if (this.root == null) {
this.root = node;
} else {
this.root.addNode(node);
}
}
private void binaryTreeSort() {
this.root.visit();
}
}
public class BinaryTree {
public static void main(String[] args) {
int[] nums = { 3, 2, 5, 6, 7, 1, 9, 0 };
Tree tree = new Tree();
for (int n : nums) {
tree.addValue(n);
}
tree.binaryTreeSort();
System.out.println("");
}
}