本文为博主原创文章, 转载请注明: https://blog.csdn.net/u011339184/article/details/131529612
学习算法过程中, 需要打印二叉树, 自己动手写了一个实现, 可以打印完全二叉树和非完全二叉树, 打印效果如下:
1
/ \
2 3
/ \ \
4 5 2
/
1
二叉树节点类
public class TreeNode {
public int value;
public TreeNode left;
public TreeNode right;
public TreeNode(int value) {
this.value = value;
}
}
打印二叉树方法
// 左右节点分支, 分隔字符, 叶子节点基础间隔
private static final String TREE_LEFT_BRANCH = "/";
private static final String TREE_RIGHT_BRANCH = "\\";
private static final String TREE_SPLIT = " ";
private static final int TREE_BASE_INTERVAL = 3;
/**
* 二叉树打印;
*
* @param head 树根节点
*/
protected void treePrint(TreeNode head) {
List<List<TreeNode>> allNodes = new ArrayList<>();
List<TreeNode> curLvNodes = Collections.singletonList(head);
allNodes.add(curLvNodes);
while (true) {
List<TreeNode> list = new ArrayList<>();
for (TreeNode node : curLvNodes) {
if (node == null) {
list.add(null);
list.add(null);
} else {
list.add(node.left);
list.add(node.right);
}
}
if (list.stream().allMatch(Objects::isNull)) {
break;
}
curLvNodes = list;
allNodes.add(curLvNodes);
}
StringBuilder sb = new StringBuilder();
int allLevel = allNodes.size();
for (int i = 0; i < allNodes.size(); i++) {
List<TreeNode> nodes = allNodes.get(i);
Object[] lvValue = new Object[nodes.size()];
for (int i1 = 0; i1 < nodes.size(); i1++) {
TreeNode node = nodes.get(i1);
if (node == null) {
lvValue[i1] = TREE_SPLIT;
} else {
lvValue[i1] = "" + node.value;
}
}
String levelString = getLevelString(lvValue, i, allLevel);
sb.append(levelString).append("\n");
}
logger.info("tree print:\n{}", sb);
}
/**
* 返回该层打印字符串;
*
* @param levelArray 该层的数组
* @param level 该层层号
* @param totalLevel 总高度
* @return 该层打印字符串
*/
private String getLevelString(Object[] levelArray, int level, int totalLevel) {
int levelInterval = (int) Math.pow(2, totalLevel - level + 1) - 1;
int leftBlank = (levelInterval - TREE_BASE_INTERVAL) / 2;
String levelIntervalStr = TREE_SPLIT.repeat(levelInterval);
StringBuilder sb = new StringBuilder();
if (level > 0) {
if (leftBlank > 0) {
sb.append(TREE_SPLIT.repeat(leftBlank));
}
for (int i = 0; i < levelArray.length; i++) {
if (TREE_SPLIT.equals(levelArray[i])) {
sb.append(TREE_SPLIT);
} else {
if (i % 2 == 0) {
sb.append(TREE_LEFT_BRANCH);
} else {
sb.append(TREE_RIGHT_BRANCH);
}
}
if (i < levelArray.length - 1) {
sb.append(levelIntervalStr);
}
}
sb.append("\n");
}
sb.append(TREE_SPLIT.repeat(leftBlank));
for (int i = levelArray.length; i > 0; i--) {
sb.append(levelArray[levelArray.length - i].toString());
if (i > 1) {
sb.append(levelIntervalStr);
}
}
return sb.toString();
}