-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathBinaryTree1.java
More file actions
131 lines (120 loc) · 2.41 KB
/
BinaryTree1.java
File metadata and controls
131 lines (120 loc) · 2.41 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
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
package binarytree;
import java.util.LinkedList;
public class BinaryTree1 {
//插入结点
static void insertNode(Tree tree, int i) {
if (tree == null) {
return;
}
Node tNode = tree.root;
Node pNode = null;
Node nNode = new Node();
nNode.value = i;
while (tNode != null) {
pNode = tNode;
if (tNode.value <= i) {
tNode = tNode.right;
} else {
tNode = tNode.left;
}
}
if (pNode == null) {
tree.root = nNode;
} else if (pNode.value > i) {
pNode.left = nNode;
} else {
pNode.right = nNode;
}
tree.size++;
}
//创建树
static Tree createTree(int[] is) {
Tree tree = new Tree();
tree.size = 0;
for (int i = 0; i < is.length; i++) {
insertNode(tree, is[i]);
}
return tree;
}
//层序遍历
static void printTreeLevelOrder(Tree tree) {
if (tree == null || tree.root == null) {
return;
}
Node node = tree.root;
LinkedList<Node> queue = new LinkedList<Node>();
Node end = node;
queue.add(node);
while (!queue.isEmpty()) {
node = queue.getFirst();
System.out.print(node.value);
if (node.left != null) {
queue.add(node.left);
}
if (node.right != null) {
queue.add(node.right);
}
if (end == node) {
System.out.print("\n");
end = queue.getLast();
} else {
System.out.print(" ");
}
queue.pop();
}
}
//打印第n层树
static void printTreeKLevel(Tree tree, int n) {
if (tree == null || tree.root == null) {
return;
}
Node node = tree.root;
LinkedList<Node> queue = new LinkedList<Node>();
Node end = node;
int count = 1;
queue.add(node);
while (!queue.isEmpty()) {
node = queue.getFirst();
if (count == n) {
System.out.print(node.value);
}
if (node.left != null) {
queue.add(node.left);
}
if (node.right != null) {
queue.add(node.right);
}
if (end == node) {
// System.out.print("\n");
end = queue.getLast();
count++;
} else {
System.out.print(" ");
}
queue.pop();
}
}
//打印叶子节点
static int getLeafNumber(Node node) {
if (node == null) {
return 0;
}
if (node.left == null && node.right == null) {
return 1;
}
return getLeafNumber(node.left) + getLeafNumber(node.right);
}
//打印树的高度
static int getTreeHeight(Node node) {
if (node == null) {
return 0;
}
int left = getTreeHeight(node.left) + 1;
int right = getTreeHeight(node.right) + 1;
if (left > right) {
return left;
} else {
return right;
}
}
}