二叉树的创建、遍历、深度、叶子节点个数
#include stdio.h>#include malloc.h>typedef struct bnode...{ char data; struct bnode *left, *right;}btree;btree *creat()...{ btree *t; char p; p = getchar(); if (p == #) re
