[자료구조] BFS&DFS&BST

소개글

BFS, DFS를 구현했습니다.
더블 링크드 리스트를 이용하여 BST를 구현하고 그래프 이론을 적용시켜 BFS, DFS를 구현했습니다.
[Interface]

[Menu: 1.Insert, 2.Delete, 3.Pre, 4.In, 5.Post, 6.Level, 7.DFS, 8.BFS, 9.Exit]choice? 1 BST1

Enter the number(s) to be inserted to BST1: 30 50 10 80 5 40 20 100

choice? M

[Menu: 1.Insert, 2.Delete, 3.Pre, 4.In, 5.Post, 6.Level, 7.DFS, 8.BFS, 9.Exit]choice? I BST1

Enter the number(s) to be inserted to BST1: 1

choice? N BST1

1 5 10 20 30 40 50 80 100

choice? f BST1

30 10 5 1 20 50 40 80 100

choice? 8 BST1

30 10 50 5 20 40 80 1 100

choice? I BST1

목차

없음

본문내용

hw10.c
/*******************************************************
File : hw10.c hw10.out hw10.exe
Date : 12/09/02
This program was designed primarily to illustrate
the following:
- Binary Search Tree
- BFS(Breath First Search) and DFS(Defth First Search)
- Linked List
********************************************************/


/**************************
Include File Section
**************************/

#include<stdio.h>
#include<stdlib.h> /* toupper */
#include<string.h> /* strcpy() */

참고 자료

없음