二叉查找树BST(1)

今天建二叉查找树BST(binary search tree)

#include <iostream>
using std::cout;
using std::endl;

using ElemType = int;

struct Node {
    ElemType data;
    Node *left;
    Node *right;
};

class BST {
public:
    BST();
    ~BST();
    void insert(ElemType data);
    Node *search(ElemType data);
    void destroy_tree();
    void preTraverse();
    void inTraverse();

private:
    void insert(ElemType data, Node *leaf);
    Node *search(ElemType data, Node *leaf);
    void destroy_tree(Node *leaf);
    void preTraverse(Node *leaf);
    void inTraverse(Node *leaf);

    Node *root;