print a binary tree in anti-clockwise direction_anti clockwise print binary tree-优快云博客

本文介绍了一种特殊的二叉树遍历方法——逆时针打印完整二叉树的轮廓。具体步骤包括：从根节点开始向下打印左侧边的所有节点；接着按从左到右的顺序打印所有叶子节点；最后再从下至上打印右侧边的所有节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a complete binary tree, print the outline of the tree in anti-clockwise direction, starting from the root. I.e. first print all the nodes on the left
edge of the tree going downwards, then print all the leaves going left to right (including leaves on both the last and the 2nd last level if necessary), then
print the nodes on the right edge of the tree going upwards.

Example tree:
A
/ \
/ \
B C
/ \ / \
D E F G
/ \ /
H I J

Expected Output: ABDHIJFGC

void print_left(Node *node) {
	if(node == null)
		return;
	if (node -> left != NULL || node->right != NULL)
		printf("%d ", node->v);
	print_left(node->left);
}

void print_right(Node *node, bool first) {
	if(node == null)
		return;

	print_right(node->rignt, false);
	if (first == false && (node -> left != NULL || node->right != NULL))
		printf("%d ", node->v);
}

void print_leafs(Node *node) {
	if (node == NULL)
		return;
	if (node->left == NULL && node->right == NULL) {
		printf("%d ", node->v);
	}
	print_leafs(node->left);
	print_leafs(node->right);
}

void print_outline(Node *root) {
	print_left(root);
	print_leafs(root);
	print_right(root, true);
}