fig12_43.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

  public:
    void insert( const vector<Comparable> & x )
    {
        insert( x, root, 0 );
    }
  
  private:
    void insert( const vector<Comparable> & x, KdNode * & t, int level )
    {
        if( t == NULL )
            t = new KdNode( x );
        else if( x[ level ] < t->data[ level ] )
            insert( x, t->left, 1 - level );
        else
            insert( x, t->right, 1 - level );
    }