내 소식

오르비

태그

내 태그
입시
학습
생활
클럽
직업·취업
Epioptimus
Centurion
오르비 랭킹
XDK 누적 복권
XDK 경매
RARE

✨컴공주✨ [1052682] · MS 2021 (수정됨) · 쪽지

2022-08-16 02:16:42
조회수 465

컴공 일기157

게시글 주소: https://dev.orbi.kr/00058025549


비선형 자료구조 Tree 구현



-LCRSTree.h 

#include <stdio.h>

#include <stdlib.h>


typedef struct tagLCRSNode

{

    struct tagLCRSNode* LeftChild;

    struct tagLCRSNode* RightSibling;


    int Data;

}LCRSNode;


LCRSNode* LCRS_CreateNode(int NewData);

void      LCRS_DestroyNode(LCRSNode* Node);

void      LCRS_DestroyTree(LCRSNode* Root);


void      LCRS_AddChildNode(LCRSNode* ParentNode, LCRSNode* ChildNode);

void      LCRS_PrintTree(LCRSNode* Node, int Depth);

void      LCRS_PrintNodeAtLevel(LCRSNode* Root, int Level);



-LCRSTree.c

#include "LCRSTree.h"


LCRSNode* LCRS_CreateNode(int NewData)

{

    LCRSNode* NewNode = (LCRSNode*)malloc(sizeof(LCRSNode));

    NewNode->LeftChild = NULL;

    NewNode->RightSibling = NULL;

    NewNode->Data = NewData;


    return NewNode;

}


void LCRS_DestroyNode(LCRSNode* Node)

{

    free(Node);

}


void LCRS_DestroyTree(LCRSNode* Root)

{

    if (Root->RightSibling != NULL)

        LCRS_DestroyTree(Root->RightSibling);


    if (Root->LeftChild != NULL)

        LCRS_DestroyTree(Root->LeftChild);


    Root->RightSibling = NULL;

    Root->LeftChild = NULL;


    LCRS_DestroyNode(Root);

}


void LCRS_AddChildNode(LCRSNode* Parent, LCRSNode* Child)

{

    if (Parent->LeftChild == NULL)

    {

        Parent->LeftChild = Child;

    }


    else {

        LCRSNode* TempNode = Parent->LeftChild;

        while (TempNode->RightSibling != NULL)

            TempNode = TempNode->RightSibling;


        TempNode->RightSibling = Child;

    }

}


void LCRS_PrintTree(LCRSNode* Node, int Depth)

{

    int i = 0;

    for (i = 0; i < Depth; i++) {

        printf(" ");

    }


    printf("%c\n", Node->Data);


    if (Node->LeftChild != NULL)

        LCRS_PrintTree(Node->LeftChild, Depth + 1);


    if (Node->RightSibling != NULL)

        LCRS_PrintTree(Node->RightSibling, Depth);


}



void LCRS_PrintNodeAtLevel(LCRSNode* Root, int Level) {

    

    if (Level == 0)

        printf("%c\n", Root->Data);


    if (Root->LeftChild != NULL && Level > 0)

        LCRS_PrintNodeAtLevel(Root->LeftChild, Level - 1);


    if (Root->RightSibling != NULL)

        LCRS_PrintNodeAtLevel(Root->RightSibling, Level);

}



-main.c


#include "LCRSTree.h"


int main(void)

{

    LCRSNode* Root = LCRS_CreateNode('A');


    LCRSNode* B = LCRS_CreateNode('B');

    LCRSNode* C = LCRS_CreateNode('C');

    LCRSNode* D = LCRS_CreateNode('D');

    LCRSNode* E = LCRS_CreateNode('E');

    LCRSNode* F = LCRS_CreateNode('F');

    LCRSNode* G = LCRS_CreateNode('G');

    LCRSNode* H = LCRS_CreateNode('H');

    LCRSNode* I = LCRS_CreateNode('I');

    LCRSNode* J = LCRS_CreateNode('J');

    LCRSNode* K = LCRS_CreateNode('K');


    LCRS_AddChildNode(Root, B);

    LCRS_AddChildNode(B, C);

    LCRS_AddChildNode(B, D);

    LCRS_AddChildNode(D, E);

    LCRS_AddChildNode(D, F);

    LCRS_AddChildNode(Root, G);

    LCRS_AddChildNode(G, H);


    LCRS_AddChildNode(Root, I);

    LCRS_AddChildNode(I, J);

    LCRS_AddChildNode(J, K);


    LCRS_PrintTree(Root, 0);

    


    LCRS_PrintNodeAtLevel(Root, 1);

    LCRS_PrintNodeAtLevel(Root, 2);

    LCRS_PrintNodeAtLevel(Root, 3);

    LCRS_DestroyTree(Root);




    return 0;

}



rare-백예린입니다

0 XDK (+0)

  1. 유익한 글을 읽었다면 작성자에게 XDK를 선물하세요.

✨컴공주✨ [1052682]

쪽지 보내기

글쓰기
오르비 1455013번째 회원 되기
아이디 찾기 비밀번호 찾기

공부를 도와주는 학습자료

오르비 과외시장

2027 수능 D - 196

오르비 플레이
오르비 RARE
Move
our corporate site
Orbi Class
on-line classes
Orbi Books
educational books & resources
Gae9
humor and fun

© 2000-2026 Move Inc.

orbisoptimus (v17-b0aa00)