二叉树代码练习

最新推荐文章于 2025-04-07 08:47:25 发布

kangquan2008

最新推荐文章于 2025-04-07 08:47:25 发布

阅读量729

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签：代码练习 tree null struct include c

本文链接：https://blog.youkuaiyun.com/huangkq1989/article/details/6793881

数据结构与算法专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一个使用C语言实现的二叉树结构及其基本操作，包括创建、前序、中序和后序遍历等，并通过栈实现了中序遍历。此外，还提供了计算树高度的方法。

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

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

#define STACK_SIZE 100

typedef struct TREE
{
	char data;
	struct TREE *left;
	struct TREE *right;
}*Tree,Node;

typedef struct STACK
{
	Node node[STACK_SIZE];
	int top;
}Stack;

void init_stack(Stack * stack)
{
	stack->top = 0;
}

int is_empty(Stack *stack)
{
	return stack->top == 0;
}

int push(Stack *stack,Node * node)
{
	if(stack->top == STACK_SIZE)
		return 0;

	stack->node[stack->top++] = *node;
	return 1;
}

int top(Stack *stack,Node *node)
{
	if(stack->top == 0)
		return 0;

	*node = stack->node[stack->top-1];
	return 1;
}

int pop(Stack *stack,Node *node)
{
	if(stack->top == 0)
		return 0;

	*node = stack->node[--stack->top];
	return 1;
}

void creat_tree(Tree * tree)
{
	char data[1];
	scanf("%s",data);

//	char data;
//	scanf("%c",data); //会把回车当输入!why?

	if(data[0] == 'a')
	{
		*tree = NULL;
	}
	else
	{
		*tree = malloc(sizeof(Node));
		if(*tree == NULL)
		{
			exit(0);
		}
			
		(*tree)->data = data[0];
		creat_tree(&((*tree)->left));
		creat_tree(&((*tree)->right));
	}
	return ;
}

void pre_order(Tree tree)
{
	if(tree == NULL)
		return ;
	
	printf("%c",tree->data);
	pre_order(tree->left);
	pre_order(tree->right);
}

void in_order(Tree tree)
{
	if(tree == NULL)
		return ;
	
	in_order(tree->left);
	printf("%c",tree->data);
	in_order(tree->right);
}

void post_order(Tree tree)
{
	if(tree == NULL)
		return ;
	
	post_order(tree->left);
	post_order(tree->right);
	printf("%c",tree->data);
}

void in_order_stack(Tree tree)
{
	if(tree == NULL)
		return ;

	Stack stack;
	init_stack(&stack);

	Node * node = malloc(sizeof(Node));

	while(!is_empty(&stack) || tree)
	{
		if(tree != NULL)
		{
			push(&stack,tree);
			tree = tree->left;
		}
		else
		{
			pop(&stack,node);
			printf("%c ",node->data);
			if(node->right != NULL)
				tree = node->right;
		}
	}
	printf("\n");
}

int tree_heigh(Tree tree)
{
	if(tree == NULL)
		return 0;
	else
	{
	       int left = tree_heigh(tree->left);
	       int right = tree_heigh(tree->right);
	       return left > right ? left+1 : right+1;
	}
}

// 1 2 3 a 4 a a a a
//     1
//   2   3
// a  4 a  a
//   a a
int main()
{
	Tree tree = NULL;
	creat_tree(&tree);
	printf("pre:\n");
	pre_order(tree);
	printf("\nin:\n");
	in_order(tree);
	printf("\npost:\n");
	post_order(tree);
	printf("\n");
	printf("Tree heigh is %d\n",tree_heigh(tree));

	in_order_stack(tree);

	return 0;
}