c++ 树集合实现记录

• 二叉树

#include<iostream>
#include<stack>
#include<queue>
using namespace std;

template<class Elem>
struct BinNode//定义二叉树链表
{
   
    Elem data;
    BinNode <Elem>* left;
    BinNode <Elem>* right;
    int h;
    BinNode(Elem x) {
   
        //初始化
        data = x;
        h = -1;
        left = right = NULL;
    }
};

//定义某种类的模板类型复杂数据时需要用 类名<..> 来声明类型
template<class Elem>
class BinTree {
   
protected:
    BinNode<Elem>* root;
    void rpreprint(BinNode<Elem>* r) {
   
        //递归遍历
        if (r == NULL) return;
        cout << r->data << " ";
        rpreprint(r->left);
        rpreprint(r->right);
    }
    BinNode<Elem>* rfindx(Elem x, BinNode<Elem>* r) {
   
        //树为空树,或者没找到
        if (!r) return NULL;
        //刚好找到了
        if (r->data == x) return r;
        //遍历查找
        BinNode<Elem>* found;
        found = rfindx(x, r->left);
        //不在左边，就在右边或者不存在
        // .....？ x:y 三元表达式
        return found ? found : rfindx(x, r->right);
    }
    void rprint(BinNode<Elem>* r, int depth) {
   
        for (int i = 0; i < depth; i++) {
   
            cout << "  ";//深度越大，打印的空格越多
        }
        if (!r) {
   
            cout << "[/]" << endl;
        }
        else
        {
   
            cout << r->data << endl;
            rprint(r->left, depth + 1);//先打印左
            rprint(r->right, depth + 1);//后打印右
        }
    }

    void rinprint(BinNode<Elem>* r) {
   
        //递归遍历
        if (r == NULL) return;
        rpreprint(r->left);
        cout << r->data << " ";
        rpreprint(r->right);
    }

    void rbackprint(BinNode<Elem>* r) {
   
        //递归遍历
        if (r == NULL) return;
        rpreprint(r->left);
        rpreprint(r->right);
        cout << r->data << " ";
    }

    void ipreprint(BinNode<Elem>* r) {
   
        //用stack是为了记录路径
        stack<BinNode<Elem>*> st;
        if (!r) return;
        while (r)
        {
   
            cout << r->data << ' ';
            st.push(r);
            r = r->left;
            while (r == NULL && !st.empty()) {
   
                r = st.top();
                st.pop();
                r = r->right;
            }
        }
    }