疑惑的return

我写一个二叉查找树，但是发现在第一次插入节点的时候，两次return呢?

/// bst.h//

#ifndef _BST_H

#define _BST_H

template <class Key>

class BinSearchTree

{

private:      struct Node

                    {Key data;         Node *lchild;         Node *rchild;

                     Node(Key da, Node* l, Node* r);    

                     };   

                   Node  *root;

                      int size;

public:       BinSearchTree();

                  void destory(Node *r);

                   Node* insert(Key,Node*);

                     bool search(Key,Node*);     

                   void sort(Node*);   

                   Node* getRoot()            

                    { return root;}

};

 #endif           

///end of the file/

//binST.cpp/

 

  #include <iostream>
#include "bst.h"
using namespace std;

template <class Key>
BinSearchTree<Key>::BinSearchTree()
{
 root = 0;
 size=0;
}

template <class Key>
typename BinSearchTree<Key>::Node *BinSearchTree<Key>::insert(Key data, Node *r)
{
 if(!r)
 {
   Node *b = new Node(data,0,0);
   if(!root) root = b;
   size++;
   return b;
 }
 if(data <= r->data ) r->lchild=insert(data,r->lchild);
 if(data > r->data  ) r->rchild=insert(data,r->rchild);
 return r; 当插入10的时候也执行。不理解为什么？

}

template <class Key>
void BinSearchTree<Key>::sort(Node* r)
{
 if(!r) return;
 sort(r->lchild);
 printf("%d,",r->data);
 sort(r->rchild);
}

template <class Key>
bool BinSearchTree<Key>::search(Key data, Node *r)
{
 if(!r) return false;
 if(data == r->data) return true;
 if(data < r->data) return search(data, r->lchild);
   else return search(data,r->rchild);
}

template <class Key>
void BinSearchTree<Key>::destory(Node *r)
{
 if(!r) return;
 destory(r->lchild);
 destory(r->rchild);
 free(r);
}

template <class Key>
BinSearchTree<Key>::Node::Node(Key da, Node* l, Node* r)
{
 data =da;
 lchild =l;
 rchild =r;
}

int main(int argc, char *argv)
{
BinSearchTree<int> bt;
bt.insert(10,bt.getRoot());
bt.insert(8,bt.getRoot());
bt.insert(11,bt.getRoot());
bt.insert(1,bt.getRoot());
bt.sort(bt.getRoot());
cout <<"Key 100 exists " << bt.search(100, bt.getRoot());
cout << endl;
bt.destory(bt.getRoot());
system("PAUSE");
return 0;
}

//end of binST.cpp/

 

本人用的DEV-C++ 编写和运行的