创建树。前序遍历，中序遍历，后序遍历。查找二叉树结点个数，查找二叉树叶子结点个数，查找二叉树度数为1的结点的个数

#include "iostream"
using namespace std;

struct tree
{
    int data;
    tree *left,*right;
};

class Tree
{
    static int n;
    static int m;
public:
    tree *root;
    Tree()
    {
        root=NULL;
    }
    void create_Tree(int);
    void preorder(tree *);
    void inorder(tree *);
    void postorder(tree *);
    int count(tree *);
    int findleaf(tree *);
    int findnode(tree *);
};

int Tree::n=0;
int Tree::m=0;

void Tree::create_Tree(int x)
{
    tree *t;
    t=new(tree);
    t->data=http://www.mamicode.com/x;>