#include<math.h>
#include<iostream>
using namespace std;
class Tree
{
private:
public:
int x;
int a[6];
static int count;
Tree();
void Printtree();
void findpc();
void yezi(); //寻找叶子节点暂时没想到
};
int Tree::count = 0;
Tree::Tree()
{
int count = 0;
cout << "请输入6个数字" << endl;
for (int i = 0; i<6; i++)
{
cin >> x;
a[i] = x; count++;
if (x == 998)
a[i] = NULL;count++;
}
}
void Tree::Printtree()
{
cout << "输出全部节点" << endl;
int q;
for (q = 0; q<6; q++)
{
for (int k = 0; k < 9; k++) //k是层数
{
if (q == pow(2, k)-1)
cout << endl;
}
cout << a[q] << " ";
}
cout << endl;
}
void Tree::findpc()
{
cout << "输入要查找的节点的下标" << endl;
int xia;
cin >> xia;
if (xia >= 6 || xia < 0)
cout << "查找
实验4:树与二叉树的实验
最新推荐文章于 2024-06-14 16:09:55 发布