java/graph/BinaryTree.java at master · uttamrc/java · 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
/*
 * 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
 */
classNode {

Nodeleft, right;
intvalue;

publicNode(intvalue) {
this.value = value;
 }

publicNodesearch(intvalue) {
if (this.value == value) {
returnthis;
 } elseif (value < this.value && this.left != null) {
this.left.search(value);
 } elseif (value > this.value && this.right != null) {
this.right.search(value);
 }

returnnull;
 }

privatevoidvisit() {
if (this.left != null) {
this.left.visit();
 }
System.out.print(this.value + " ");
if (this.right != null) {
this.right.visit();
 }
 }

privatevoidaddNode(Nodenode) {
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);
 }
 }
 }
}

classTree {

Noderoot;

privatevoidaddValue(intvalue) {
Nodenode = newNode(value);
if (this.root == null) {
this.root = node;
 } else {
this.root.addNode(node);
 }
 }

privatevoidbinaryTreeSort() {
this.root.visit();
 }
}

publicclassBinaryTree {

publicstaticvoidmain(String[] args) {
int[] nums = { 3, 2, 5, 6, 7, 1, 9, 0 };
Treetree = newTree();
for (intn : nums) {
tree.addValue(n);
 }

tree.binaryTreeSort();
System.out.println("");
 }
}