-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrintBinaryTree.java
More file actions
68 lines (60 loc) · 2.04 KB
/
Copy pathPrintBinaryTree.java
File metadata and controls
68 lines (60 loc) · 2.04 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
package tree;
/**
* @Author: wei1
* @Date: Create in 2018/11/22 0:56
* @Description:
*/
public class PrintBinaryTree {
public static void printTree(TreeNode head) {
System.out.println("Binary Tree:");
printInOrder(head, 0, "H", 17);
System.out.println();
}
public static void printInOrder(TreeNode head, int height, String to, int len) {
if (head == null) {
return;
}
printInOrder(head.right, height + 1, "v", len);
String val = to + head.val + to;
int lenM = val.length();
int lenL = (len - lenM) / 2;
int lenR = len - lenM - lenL;
val = getSpace(lenL) + val + getSpace(lenR);
System.out.println(getSpace(height * len) + val);
printInOrder(head.left, height + 1, "^", len);
}
public static String getSpace(int num) {
String space = " ";
StringBuffer buf = new StringBuffer("");
for (int i = 0; i < num; i++) {
buf.append(space);
}
return buf.toString();
}
public static void main(String[] args) {
TreeNode head = new TreeNode(1);
head.left = new TreeNode(-222222222);
head.right = new TreeNode(3);
head.left.left = new TreeNode(Integer.MIN_VALUE);
head.right.left = new TreeNode(55555555);
head.right.right = new TreeNode(66);
head.left.left.right = new TreeNode(777);
printTree(head);
head = new TreeNode(1);
head.left = new TreeNode(2);
head.right = new TreeNode(3);
head.left.left = new TreeNode(4);
head.right.left = new TreeNode(5);
head.right.right = new TreeNode(6);
head.left.left.right = new TreeNode(7);
printTree(head);
head = new TreeNode(1);
head.left = new TreeNode(1);
head.right = new TreeNode(1);
head.left.left = new TreeNode(1);
head.right.left = new TreeNode(1);
head.right.right = new TreeNode(1);
head.left.left.right = new TreeNode(1);
printTree(head);
}
}