c语言简单创建二叉树

最新推荐文章于 2024-07-02 08:21:54 发布

孑澈

最新推荐文章于 2024-07-02 08:21:54 发布

阅读量1.4w

点赞数 3

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/jieche01/article/details/53560517

版权

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

15 篇文章 0 订阅

订阅专栏

#include <stdio.h>
typedef    int DataType;
typedef struct tree
{
	DataType data;
	struct tree *left;
	struct tree *right;
}node,*pnode;

pnode createTreeNode(DataType data)
{
	pnode n=(pnode)malloc(sizeof(node));
	n->data = data;
	n->left = NULL;
	n->right = NULL;
	return n;

}
void treeTravel(pnode p)
{
	if (NULL == p)
	{
		return;
	}
	treeTravel(p->left);
	printf("%d  ", p->data);
	treeTravel(p->right);

}
/*


              7 1 5 6 2 9 4 8 6

			  7

         1         9
	         5   8
		  3   6  
		2   4








*/
void main()
{
	pnode root=NULL;

	pnode p1=NULL, p2=NULL, p3=NULL, p4=NULL, p5=NULL, p6=NULL, p7=NULL,p8=NULL,p9=NULL;

	p1 = createTreeNode(7);
	p2 = createTreeNode(1);
	p3 = createTreeNode(9);
	p4 = createTreeNode(5);
	p5 = createTreeNode(8);
	p6 = createTreeNode(3);
	p7 = createTreeNode(6);
	p8 = createTreeNode(2);
	p9 = createTreeNode(4);

	p1->left = p2;
	p1->right = p3;

	p2->right = p4;

	p3->left = p5;

	p4->left = p6;
	p4->right = p7;

	p6->left = p8;
	p6->right = p9;
	
	root = p1;
	treeTravel(root);

	getchar();
}