先序创建二叉树及三种遍历
#include<stdio.h>#include<stdlib.h>int max = 0;struct node{ int data; struct node *left; struct node *right;};struct node *create(struct node *newNode){//先序创建二叉树 char data; sca