广义表转二叉树实现

// 广义表转二叉树

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct Node {
   
    char data;
    struct Node *lchild, *rchild;
} Node;

typedef struct Tree {
   
    Node *root;
    int length;
} Tree;

typedef struct Stack {
   
    Node **data;
    int top, size;
} Stack;

Node *getNewNode(char val) {
   
    Node *p = (Node *)malloc(sizeof(Node));
    p->data = val;
    p->lchild = p->rchild = NULL;
    return p;
}

Tree *getNewTree() {
   
    Tree *tree = (Tree *)malloc(sizeof(Tree));
    tree->root = NULL;
    tree->length = 0;
    return tree;
}

Stack *init_stack(int n) {
   
    Stack *s = (Stack *)malloc(sizeof(Stack));
    s->data = (Node **)malloc(sizeof(Node *) * n);
    s->top = -1;
    s->size = n;
    return s;
}

Node *top(Stack *s