二叉树生成与打印显示 c语言实现

程序效果

刷题时有个二叉树可视化的程序就好了，于是乎自己写了一个。将"__Tree codes.cpp"及"__Tree codes.h"导入即可使用。 一个 bt_print(root) 函数即可完成二叉树可视化。
先上二叉树打印效果图：

接口

从数组生成二叉树的函数以及打印二叉树的函数为：

// 从nums数组生成二叉树。数组元素须为小于等与999的正整数，空节点以宏定义numMeansNull表示。
struct TreeNode *createTreeFromArray(int *nums, int numsSize);
// 打印二叉树bt
void bt_print(TreeNode *bt);

使用举例

上图的二叉树是由如下数组生成的：

int nums[] = { 15,54,87,1,45,20,4,88,452,10,20,13,2,150,5, 6,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 };
struct TreeNode* root = createTreeFromArray(nums, sizeof(nums) / sizeof(nums[0]));
bt_print(root);

如果有部分节点为空，则数组中对应位置的元素应设置成与 numMeansNull 相等的值，numMeansNull被宏定义为-1.
如下代码

int nums[] = { 15,54,87,1,45,20,4,88,452,-1,-1,13,-1,150,5, 6,-1,3,4,5,6,7,8,9,-1,11,12,13,14,15,16 };
struct TreeNode* root = createTreeFromArray(nums, sizeof(nums) / sizeof(nums[0]));
bt_print(root);

生成的二叉树如下

完整的程序

可从我的代码库 https://github.com/zqxl/leetcode 下载。
完整代码如下：

“__Tree codes.h”

/*二叉树生成与打印程序*/
#pragma once
#include<stdio.h>
#include<vector>
#include<math.h>
#include<malloc.h>

// 数组中数值等与此值的元素将被视为二叉树中的空节点
#define numMeansNull -1

// Definition for a binary tree node.
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

// 从nums数组生成二叉树。数组元素须为小于等与999的正整数，空节点以宏定义numMeansNull表示。
struct TreeNode *createTreeFromArray(int *nums, int numsSize);
// 打印二叉树bt
void bt_print(TreeNode *bt);

“__Tree codes.cpp”

#include"__Tree codes.h"

void calTreeDepth(TreeNode *t);
void setPrintBuffer(TreeNode *t);

// 由二维数组生成二叉树
struct TreeNode *createTreeFromArray(int *nums, int numsSize) {
	struct TreeNode *nodes = (struct TreeNode*)calloc(numsSize, sizeof(struct TreeNode));
	for (int i = 0; i < numsSize; i++) {
		nodes[i].val = nums[i];
		int child = i * 2 + 1;
		nodes[i].left = (child < numsSize && nums[child] != numMeansNull) ? &nodes[child] : NULL;
		child = i * 2 + 2;
		nodes[i].right = (child < numsSize && nums[child] != numMeansNull) ? &nodes[child] : NULL;
	}
	return &nodes[0];
}

// 当前节点的深度
int depth = 0;
// 该树的深度，如果只有根节点则深度为1
int depthMax = 0;
// 打印缓冲区的宽度，当前应打印的列数，上次打印位置的列数
int width = 0, column = 0, lastColumn = 0;
char **printBuffer = NULL;

void bt_print(TreeNode *bt) {
	depth = 0;
	column = 0;
	lastColumn = 0;
	depthMax = 0;
	// 根据树的大小申请内存
	calTreeDepth(bt);
	width = 3 * ((1 << (depthMax - 1)) * 2 - 1);
	int height = 1 + (depthMax - 1) * 3;
	printBuffer = (char**)malloc(height *sizeof(char*));
	for (int i = 0; i < height; i++) {
		printBuffer[i] = (char*)malloc(width * sizeof(char));
		memset(printBuffer[i],' ',width);
		printBuffer[i][width - 1] = '\0';
	}

	depth = 0;
	column = width / 2;
	lastColumn = column;
	setPrintBuffer(bt);
	for (int i = 0; i < height; i++) {
		for (int j = 0; j < width; j++) {
			printf("%c", printBuffer[i][j]);
		}
		printf("\n");
	}

}

// 递归找到该树的最大深度
void calTreeDepth(TreeNode *t) {
	if (t) {
		depth++;
		depthMax = depthMax < depth ? depth : depthMax;
		calTreeDepth(t->left);
		calTreeDepth(t->right);
		depth--;
	}
}

// 先序遍历，将数据设置到打印缓冲区
void setPrintBuffer(TreeNode *t) {
	if (t) {
		depth++;

		int val = t->val;
		for (int i = 0; i < 3; i++) {
			printBuffer[(depth - 1) * 3][column+1-i] = val%10 + 0x30;
			val /= 10;
		}
		if (depth > 1) {
			int linkLineInterval =  (column- lastColumn)/3;
			char linkChar = linkLineInterval > 0 ? '\\' : '/';
			printBuffer[(depth - 1) * 3 - 1][column - linkLineInterval] = linkChar;
			printBuffer[(depth - 1) * 3 - 2][column - 2*linkLineInterval] = linkChar;
		}
		
		int step = (1<<(depthMax-depth-1))*3;

		lastColumn = column;
		column -= step;
		setPrintBuffer(t->left);
		column += step;

		lastColumn = column;
		column += step;
		setPrintBuffer(t->right);
		column -= step;
		depth--;
	}
}

测试程序:

#include"__Tree codes.h"

int main() {
	int nums[] = { 15,54,87,1,45,20,4,88,452,-1,-1,13,-1,150,5, 6,-1,3,4,5,6,7,8,9,-1,11,12,13,14,15,16 };
	struct TreeNode* root = createTreeFromArray(nums, sizeof(nums) / sizeof(nums[0]));
	bt_print(root);
	getchar();
	return 0;
}