#include <iostream>
using namespace std;
class BiTNode
{
private:
char data;
BiTNode *lchild, *rchild;
public:
BiTNode(){}
BiTNode(char c):data(c){};
~BiTNode(){}
friend class BiTree;
};
class BiTree
{
private:
BiTNode *root;
void CreateTree(BiTNode *&p);
void PreOrderTraverse(BiTNode *p, int i, int &j);
public:
BiTree(){}
~BiTree(){}
void CreateTree();
void PreOrder();
};
void BiTree::CreateTree()
{
CreateTree(root);
}
void BiTree::CreateTree(BiTNode *&p)
{
char ch;
cin>>ch;
if(ch!='0')
{
p = new BiTNode(ch);
CreateTree(p->lchild);
CreateTree(p->rchild);
}
else
p = NULL;
}
void BiTree::PreOrder()
{
int i = 1;
int j = 0;
PreOrderTraverse(root, i, j);
cout<<j<<endl;
}
void BiTree::PreOrderTraverse(BiTNode *p, int i, int &j)
{
if(p)
{
if(i>j)
j = i;
i++;
PreOrderTraverse(p->lchild, i, j);
PreOrderTraverse(p->rchild, i, j);
}
}
int main(void)
{
int t;
cin>>t;
while(t--)
{
BiTree myTree;
myTree.CreateTree();
myTree.PreOrder();
}
return 0;
}
DS树--二叉树高度
最新推荐文章于 2024-07-21 11:20:00 发布