一般树的手工打造，遍历，求节点数和树高

//一般树的手工打造，遍历，求节点数和树高 
#include <cstdlib>
#include <iostream>
#include <vector>//使用向量需包含该文件 

using namespace std;
  
template<typename T>
struct Tnode{

    typedef vector<Tnode*> CT; //特别注意向量后的<数据呈放类型>，太坑了!!! 
    //typedef CT child_container_type；
    typedef T Value_type;
    CT children_;
    T value_;
    Tnode(T const& v=T()):value_(v){} 
    T& value(void){return value_;}
    void add_child(Tnode* ch){children_.push_back(ch);}
    int degree(void) const{return children_.size();}
    bool leafnode(void) const{return children_.empty();} 
};

template<typename NT>
int size(NT* root){
    if(root==0) return 0;
    int result=1;
    typedef typename NT::CT::iterator CI;
    CI fc=root->children_.begin();//返回容器向量的首地址 
    CI lc=root->children_.end();
    for(;fc!=lc;++fc) result+=size(*fc); 
    return result;
    }
    
template<typename NT>  
 int height(NT* root){
     if(root==0) return 0;
     int max=0;
     typedef typename NT::CT::iterator CI;
     CI fc=root->children_.begin();
     CI lc=root->children_.end();
     for(;fc!=lc;++fc){
      int h=height(*fc);
      if(h>max) max=h;                 
                       }
      return max+1;
     }   
     
 template<typename NT>
 void preorder(NT* root,void(*visit)(NT*)){
      if(root!=0){
        visit(root);
      typedef typename NT::CT::iterator CI;
      CI fc=root->children_.begin();
      CI lc=root->children_.end();
       for(;fc!=lc;++fc)
          preorder(*fc,visit);                                      
                  }
      }
      
  template<typename NT>
 void postorder(NT* root,void(*visit)(NT*)){
      if(root!=0){
      typedef typename NT::CT::iterator CI;
      CI fc=root->children_.begin();
      CI lc=root->children_.end();
       for(;fc!=lc;++fc)
          postorder(*fc,visit);                                      
         visit(root);        
                  }
      }
      
 //template<typename NT>
 typedef Tnode<char> NT; 
 void print(NT* p){std::cout<<p->value()<<"";}
    
int main(int argc, char *argv[])
{   
    NT e('E');NT f('F');NT b('B');
    b.add_child(&e);b.add_child(&f);//注意怎样取模板类对象的地址
    NT g('G');NT c('C');
    c.add_child(&g);
    NT d('D');NT a('A');
    a.add_child(&b);a.add_child(&c); 
    NT* root=&a;
    int as=size(root);
    int ah=height(root);
    int ad=a.degree();
    bool al=a.leafnode(); bool dl=d.leafnode();
    preorder(root,&print);cout<<endl;
    postorder(root,&print);cout<<endl;
    
    system("PAUSE");
    return EXIT_SUCCESS;
}