forked from nibnait/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrintBinaryTree.java
More file actions
103 lines (89 loc) · 3.13 KB
/
PrintBinaryTree.java
File metadata and controls
103 lines (89 loc) · 3.13 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
package common.util;
import common.datastruct.BinaryTreeNode;
import common.datastruct.TreeNode;
/**
* 打印二叉树
*
* Created by nibnait on 2016/9/15.
*/
public class PrintBinaryTree {
private static final int NODE_LENGTH = 17; //二叉树中每个结点的长度
/**
* ‘*’ 代表根结点
* ‘~’ 代表左子结点
* ‘_’ 代表右子结点
*
* @param head 树的根结点
*/
public static void print(BinaryTreeNode head) {
System.out.println("Binary Tree：");
printInOrder(head, 0, "*");
System.out.println();
}
private static void printInOrder(BinaryTreeNode head, int height, String to) {
if (head == null){
return;
}
printInOrder(head.left, height+1, "~");
String val = to + head.value + to;
int lenM = val.length();
int lenL = (NODE_LENGTH - lenM) / 2;
int lenR = NODE_LENGTH - lenL - lenM;
val = getSpace(height*NODE_LENGTH + lenL) + val + getSpace(lenR);
System.out.println(val);
printInOrder(head.right, height+1, "_");
}
public static void print(TreeNode head) {
System.out.println("Binary Tree：");
printInOrder(head, 0, "*");
System.out.println();
}
private static void printInOrder(TreeNode head, int height, String to) {
if (head == null){
return;
}
printInOrder(head.left, height+1, "~");
String val = to + head.val + to;
int lenM = val.length();
int lenL = (NODE_LENGTH - lenM) / 2;
int lenR = NODE_LENGTH - lenL - lenM;
val = getSpace(height*NODE_LENGTH + lenL) + val + getSpace(lenR);
if (!val.contains("null")){
System.out.println(val);
}
printInOrder(head.right, height+1, "_");
}
private static String getSpace(int n) {
StringBuffer sb = new StringBuffer();
for (int i = 0; i < n; i++) {
sb.append(" ");
}
return sb.toString();
}
public static void main(String[] args) {
BinaryTreeNode head = new BinaryTreeNode(1);
head.left = new BinaryTreeNode(-222222222);
head.right = new BinaryTreeNode(3);
head.left.left = new BinaryTreeNode(Integer.MIN_VALUE);
head.right.left = new BinaryTreeNode(55555555);
head.right.right = new BinaryTreeNode(66);
head.left.left.right = new BinaryTreeNode(777);
print(head);
head = new BinaryTreeNode(1);
head.left = new BinaryTreeNode(2);
head.right = new BinaryTreeNode(3);
head.left.left = new BinaryTreeNode(4);
head.right.left = new BinaryTreeNode(5);
head.right.right = new BinaryTreeNode(6);
head.left.left.right = new BinaryTreeNode(7);
print(head);
head = new BinaryTreeNode(1);
head.left = new BinaryTreeNode(1);
head.right = new BinaryTreeNode(1);
head.left.left = new BinaryTreeNode(1);
head.right.left = new BinaryTreeNode(1);
head.right.right = new BinaryTreeNode(1);
head.left.left.right = new BinaryTreeNode(1);
print(head);
}
}