Binary Serach Tree 구현 ( 삽입, 삭제, 탐색, 검색 )

소개글

Binary Serach Tree 구현 ( 삽입, 삭제, 탐색, 검색 )에 대한 보고서 자료입니다.

목차

☞ Source Code ( hw9.c ) - 3 -


☞ hw9.out - 20 -

본문내용

실행 결과

Welcome to Binary Search Tree Program.

[ Menu(M) : 1.Insert(I), 2.Delete(D), 3.Pre(P), 4.In(N), 5.Post(O), 6.Level(L), 7.DFS(F), 8.BFS(B), 9.Exit(X) ]
Choice? i
Menu '1' is has one argument..can't execution...
Choice? i BST
'BST' is can't access Tree!
Tree name is must BST1.
Choice? i BST1
Enter the number(s) to be inserted to BST1 : 10 5 2 6 22 20 30
Choice? p BST1
10 5 2 6 22 20 30
Choice? n BST1
2 5 6 10 20 22 30
Choice? o BST1
2 6 5 20 30 22 10
Choice? l BST1
10 5 22 2 6 20 30
Choice? f BST1
10 5 2 6 22 20 30
Choice? b BST1
10 5 22 2 6 20 30
Choice? i BST1
Enter the number(s) to be inserted to BST1 : 17
Choice? p BST1
10 5 2 6 22 20 17 30
Choice? i BST1
Enter the number(s) to be inserted to BST1 : 103
Choice? p BST1
10 5 2 6 22 20 17 30 103
Choice? d BST1
Enter the number(s) to be Deleted to BST1 : 17
Choice? 3 BST1
10 5 2 6 22 20 30 103
Choice? d BST1
Enter the number(s) to be Deleted to BST1 : 2 22
Choice? p BST1
10 5 6 20 30 103
Choice? M
[ Menu(M) : 1.Insert(I), 2.Delete(D), 3.Pre(P), 4.In(N), 5.Post(O), 6.Level(L), 7.DFS(F), 8.BFS(B), 9.Exit(X) ]
Choice? f BST1
10 5 6 20 30 103
Choice? b BST1
10 5 20 6 30 103
Choice? i BST1
Enter the number(s) to be inserted to BST1 : 26 12
Choice? p BST1
10 5 6 20 12 30 26 103
Choice? f BST1
10 5 6 20 12 30 26 103
Choice? l BST1
10 5 20 6 12 30 26 103
Choice? b BST1
10 5 20 6 12 30 26 103
Choice? d BST1
Enter the number(s) to be Deleted to BST1 : 20 6 12 26
Choice? p BST1
10 5 26 103
Choice?
Choice? x

Goodbye and thanks for using this software



해당자료는 한글2002나 워디안 자료로 한글97에서는 확인하실 수 없으십니다.

키워드

BST,   binary search tree,   tree,   자료구조,   data structure,   traversal,   search