소개글
c++을 이용하여 기능들을 클레스화 하여구현.
int main(){
B_tree b = B_tree();
int sel, key, lev,len;
char* searchData;
bool conti = true;
show();
while(conti){
char data[100];
char* inData;
B_treeStack* pathStack;//경로 출력에 사용
cout << "삽입(1), 삭제(2), 트리출력(3), 검색(4), 추가 기능(5), 추가 기능(6),종료(7) : ";
fflush(stdin);
cin >> sel;
if (!checkInt(cin))//입력 값이 int형인지 검사
continue;
switch(sel)
{
case 1:
cout << "삽입할 키와 데이터를 입력하세요!!" << endl;
cout << "key : ";
cin >> key;
if (!checkInt(cin))
continue;
cout << "Data : ";
cin >> data;
inData = new char[sizeof(data)];
strcpy(inData,data);
inData[sizeof(data)] = '\0';
if(!(b.insert(key,inData)))
cout << "같은 키값이 있습니다." << endl;
break;
case 2:
cout << "삭제할 키를 입력하세요!!" << endl;
cout << "key : ";
cin >> key;
if (!checkInt(cin))
continue;
if(!(b.remove(key)))
cout << "삭제할 내용이 없습니다." << endl;
break;
case 3:
cout << "노드 간격입력:";
cin >> len;
if (!checkInt(cin))
continue;
b.printTree(len);
cout << endl << endl;
break;
컴파일 실행환경
Microsoft visual c++ 6.0압축파일 내 파일목록
B.ASP
B_treData.cpp
B_tree.asp
B_tree.cpp
B_tree.dsp
B_tree.dsw
B_tree.h
B_tree.ncb
B_tree.opt
B_tree.plg
B_treeData.cpp
B_treeData.h
B_treeNode.cpp
B_treeNode.h
B_treeQueue.cpp
B_treeQueue.h
B_treeStack.cpp
B_treeStack.h
B_tree_DataStack.cpp
B_tree_DataStack.h
main.cpp
B_treData.cpp
B_tree.asp
B_tree.cpp
B_tree.dsp
B_tree.dsw
B_tree.h
B_tree.ncb
B_tree.opt
B_tree.plg
B_treeData.cpp
B_treeData.h
B_treeNode.cpp
B_treeNode.h
B_treeQueue.cpp
B_treeQueue.h
B_treeStack.cpp
B_treeStack.h
B_tree_DataStack.cpp
B_tree_DataStack.h
main.cpp