LeetCode刷题总结（C语言版）_测试类

记录测试代码

int main() {

	int *returnSize = NULL;
	int **returnColumnSizes = NULL;
	struct TreeNode *root  = NULL;
	struct TreeNode *left  = NULL;
    struct TreeNode *right = NULL;
	struct TreeNode *right_r = NULL;
	struct TreeNode *right_l = NULL;

	returnSize = (int *)malloc(sizeof(4));
	returnColumnSizes  = (int **)malloc(sizeof(int **));
	*returnColumnSizes = (int *)malloc(sizeof(int *));

	root  = (struct TreeNode *)malloc(sizeof(struct TreeNode));
	left  = (struct TreeNode *)malloc(sizeof(struct TreeNode));
	right = (struct TreeNode *)malloc(sizeof(struct TreeNode));
	right_r = (struct TreeNode *)malloc(sizeof(struct TreeNode));
	right_l = (struct TreeNode *)malloc(sizeof(struct TreeNode));

	right_r->val = 7;
	right_l->val = 15;
	right->val = 20;
	left->val  = 9;
	root->val  = 3;
	root->left = left;
	left->left = NULL;
	left->right = NULL;
	root->right = right;

	right->left = right_l;
	right->right = right_r;

	right_r->right = NULL;
	right_r->left  = NULL;
	right_l->right = NULL;
	right_l->left  = NULL;

	levelOrder(root, returnSize, returnColumnSizes);

	return 0;
}