C++类实现二叉树的构建和遍历、深度

原创已于 2022-07-05 15:12:29 修改 · 512 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #开发语言

于 2018-03-03 15:47:57 首次发布

算法专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个基于C++实现的二叉树创建过程及其先序、中序和后序遍历方法，并展示了如何计算二叉树的深度和节点数。

typedef struct _btree
{
	int			        _val;
	struct _btree*		_rchild;
	struct _btree*		_lchild;
}BTREE;

class Htree
{
public:
	BTREE* CreateTree(int tlevel, string tpos);
	void   PreOrder(BTREE* t);
	void   InOrder(BTREE* t);
	void   PostOrder(BTREE* t);
    int    GetDepth(BTREE* t);
    int    getTreeNum(BTREE* t)
private:
	BTREE* _root;
};

BTREE*	Htree::CreateTree(int tlevel, string tpos)
{
	if (tlevel == 0)
		return NULL;

	BTREE* node   = new BTREE();
	node->_val    = tlevel;
	node->_lchild = NULL;
	node->_rchild = NULL;

	if (tlevel == 1)
		return node;

	node->_lchild = CreateTree(tlevel - 1, "lchild");
	node->_rchild = CreateTree(tlevel - 1, "rchild");

	return node;

}


void Htree::PreOrder(BTREE* t)
{
	if (t != NULL)
	{
		cout << t->_val << endl;
		PreOrder(t->_lchild);
		PreOrder(t->_rchild);
	}
}
void   Htree::InOrder(BTREE* t)
{
	if (t != NULL)
	{
		
		InOrder(t->_lchild);
        cout << t->_val << endl;
		InOrder(t->_rchild);
	}
}
void   Htree::PostOrder(BTREE* t)
{
	if (t != NULL)
	{
		
		PostOrder(t->_lchild);
		
		PostOrder(t->_rchild);

		cout << t->_val << endl;
	}
	
}
int    Htree::GetDepth(BTREE* t)
{
    if(t == NULL)
        return 0;
    int left = GetDepth(t->lchild) + 1;
    int right = GetDepth(t->rchild) + 1;

    return left > right ? left:right;
}

int    Htree::getTreeNum(BTREE* t)
{
    if (t == NULL)
      return 0;

    int left = getTreeNum(t->lChild);
    int right = getTreeNum(t->rChild);
    return left + right + 1;
}

int main()
{

	Htree kk;
	BTREE* root = kk.CreateTree(3,"root");

	kk.PreOrder(root);
	getchar();

	return 0;
}