二叉树表示树

qq_187352634

于 2024-06-30 15:37:53 发布

阅读量152

点赞数 1

分类专栏： C++ 文章标签：二叉树表示树

本文链接：https://blog.csdn.net/qq_37755459/article/details/140081771

版权

C++ 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

二叉树表示树

Tree结点

Tree结点

#include <iostream>
using namespace std;
struct Tree{
	int data;
	Tree * child;
	Tree * brother;
	Tree(int x){
		data = x;
		child = brother =NULL;
	}
	~Tree(){
		if(child) delete child;
		if(brother) delete brother;
	}
	void add(Tree * t){
		if(child == NULL)
			child = t;
		else 
			child->add_brother(t);
	}
	void add_brother(Tree * t){
		if(brother == NULL)
			brother = t;
		else 
			brother->add_brother(t);
	}
	void pre_order(){
		cout << data << " ";
		if(child) child ->pre_order();
		if(brother) brother ->pre_order();
	}
	void in_order(){
		if(child) child ->pre_order();
		cout << data << " ";
		if(brother) brother ->pre_order();
	}
}; 
int main(){
	Tree a(1);
	a.add(new Tree(2));
	a.add(new Tree(3));
	a.add(new Tree(4));
	a.child->brother->add(new Tree(5));
	a.child->brother->add(new Tree(6));
	a.pre_order();
	cout<<endl;
	a.in_order();
	cout<<endl;
}