|
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
|
|
|
실행 결과
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.
Ch
|
|
메뉴펼치기
