二叉树的相关操作

2.1 创建二叉树

代码：

#include "stdio.h"

#define MAXSIZE 100
typedef char elemtype;

typedef struct 
{
    elemtype *elem;
    int len;
}sqbitree_node, *sqbitree;

typedef struct 
{
    elemtype data;
    struct binode *lchild, *rchild;
}binode, *bitree;

void init_bitree(bitree *bt);
void destroy_bitree(bitree *node);
void create_bitree(bitree *node);
void create_bitree_input(bitree *node);

char *pointer;
void main() {
    //binode *root;
    bitree btree;
    
    //binode *binode = NULL;
    init_bitree(&btree);
    char *str = "AB#CD####";

    //create_bitree_input(&btree);
    pointer = str;
    create_bitree(&btree);

}

void init_bitree(bitree *bt) {
    *bt = NULL;
}

void create_bitree_input(bitree *btree) {
    char ch;
    printf("Please input char: ");
    scanf("%c", &ch);
    getchar();
    if(ch == '#') return;
    binode *node = (binode