c++二叉树基本应用

代码

#include <iostream>
using namespace std;
    struct BT_struct
    {
        int vail;
        BT_struct* left;
        BT_struct* right;
    }*bt_struct;
BT_struct* ROOT = new BT_struct;
void rysrettryes(BT_struct* bt_struct,int i,int y) {
        if (i < 3) {
            i += 1;
            cout <<bt_struct->vail<<" ";//访问根结点
            rysrettryes(bt_struct->left,i,y);//先序遍历左子树
            rysrettryes(bt_struct->right,i,y);//先序遍历右子树
        }}
void mefsces(BT_struct* bt_struct,int i,int y) {
    if (i < 3) {
        i += 1;
        bt_struct->vail=i;
        bt_struct->left = new BT_struct;
        bt_struct->right = new BT_struct;
        mefsces(bt_struct->left,i,y);
        mefsces(bt_struct->right,i,y);
    }}
void delete_BT(BT_struct* bt_struct, int i,int y) {
    if (i < 3) {
        i += 1;
        delete_BT(bt_struct->left, i,y);
        delete_BT(bt_struct->right, i,y);
        delete(bt_struct);
    }}
int main()
{
    bt_struct = ROOT;
    mefsces(bt_struct, 0,3);
    rysrettryes(bt_struct,0,3);
    delete_BT(bt_struct, 0,3);
    return 0;
}