二叉树的链接表示

最新推荐文章于 2022-07-11 09:49:25 发布

原创最新推荐文章于 2022-07-11 09:49:25 发布 · 1.8k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#struct #include #null #c

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

typedef int DataType;

struct BinTreeNode;
typedef struct BinTreeNode *PBinTreeNode;

struct BinTreeNode {
    DataType info;
    PBinTreeNode llink;
    PBinTreeNode rlink;
};

typedef struct BinTreeNode *BinTree;

typedef BinTree *PBinTree;

PBinTreeNode root_btree(PBinTree t) {
    return *t;
}

PBinTreeNode leftChild_btree (PBinTreeNode p) {
    return p->llink;
}

PBinTreeNode rightChild_btree (PBinTreeNode p) {
    return p->rlink;
}

PBinTreeNode createRest_BTree() {
    PBinTreeNode pbnode;
    char ch;
    scanf("%c", &ch);
    if(ch == '@') pbnode = NULL;
    else {
        pbnode = (PBinTreeNode )malloc(sizeof(struct BinTreeNode));
        if( pbnode == NULL )         {
            printf("Out of space!/n");
            return pbnode;
        }
        pbnode->info = ch;
        pbnode->llink = createRest_BTree();
        pbnode->rlink = createRest_BTree();
    }
    return pbnode;
}

PBinTree create_BTree( void ) {
    PBinTree pbtree;
    pbtree = (PBinTree)malloc(sizeof(BinTree));
    if (pbtree != NULL)
        *pbtree = createRest_BTree( );
    return pbtree;
}

int main(){
return 0;
}