BST构造

#include<iostream>
using namespace std;
#include<queue>
class BstTree{
  struct Node{
    Node *left;
    Node *right;
    int data;
    Node(int i):data(i),left(NULL),right(NULL){
      
    }
  };
public:
  Node* root;
  BstTree():root(NULL){
    
  }
  //插入，往哪个树，插什么值
  void insert(Node *p,int i){
    if(root==NULL){
      root = new Node(i);
    }else{
      if(i<p->data)
      {
        if(p->left==NULL){
          p->left = new Node(i);
        }else{
          insert(p->left, i);
        }
      }
      else if(i>p->data){    //纯粹为了可读性写成这样
        if(p->right==NULL){
          p->right = new Node(i);
        }else{
          insert(p->right, i);
        }
      }
    }
  }
  
};