#include<stdio.h>
#include<stdlib.h>
typedef char E;
typedef struct TreeNode* Node;
struct TreeNode{
E element;
struct TreeNode* left;
struct TreeNode* right;
};
int main()
{
Node a = malloc(sizeof(struct TreeNode));
Node b = malloc(sizeof(struct TreeNode));
Node c = malloc(sizeof(struct TreeNode));
Node d = malloc(sizeof(struct TreeNode));
Node e = malloc(sizeof(struct TreeNode));
a->element='A';
b->element='B';
c->element='C';
d->element='D';
e->element='E';
a->left=b;
a->right=c;
b->left=d;
b->right=e;
c->left=NULL;
c->right=NULL;
d->left=NULL;
d->right=NULL;
e->left=NULL;
e->right=NULL;
}
数据结构笔记(十二)二叉树的构建
于 2024-03-16 20:34:44 首次发布