0001 template <typename T> BinNodePosi<T> BinNode<T>::insertLc( T const& e )
0002    { return lc = new BinNode<T>( e, this ); } //将e作为当前节点的左孩子插入二叉树
0003 
0004 template <typename T> BinNodePosi<T> BinNode<T>::insertRc( T const& e )
0005    { return rc = new BinNode<T>( e, this ); } //将e作为当前节点的右孩子插入二叉树