이진트리에 관련된 질문입니다
꼼지
삭제하는부분 의 코드 설명 좀 부탁드립니다. deleteNode 함수 부분입니다
이해가 잘되지 않네요;;;#include stdio.h
#include stdlib.h
#include memory.h
typedef struct TreeNode{
char data;
struct TreeNode* left;
struct TreeNode* right;
}TreeNode;
TreeNode* makeRootNode(){
TreeNode *root;
root=(TreeNode*)malloc(sizeof(TreeNode));
root-data=0;
root-left=NULL;
root-right=NULL;
return root;
}
void insertNode(int data,TreeNode *T){
TreeNode *p;//
p = (TreeNode *)malloc(sizeof(TreeNode));
p - data = data;
p -left = NULL;
p -right = NULL;
if(data T-data){
if( T-left !=NULL){
insertNode(data, T-left);
}
else{
T-left = p;
}
}
else{
if(T-right !=NULL){
insertNode(data,T-right);
}
else{
T-right = p;
}
}
return;
}
//寃??
TreeNode* searchNode(int data,TreeNode *T){
TreeNode *search=T;
while(search != NULL){
if(search-data == data){
return search;
}
else if(search-data data){
search = search - left;
}
else if(search-datadata){
search = search -right;
}
else {
printf(?낅젰?섏떊 媛믪씠 ?놁뒿?덈떎.!\n);
return;
}
}
}
//?몃뱶 媛?닔 ??
int countNode(TreeNode *T){
int count=0;
if(T != NULL){
count=1+
countNode(T-left)+countNode(T-right);
}
return count;
}
// ?몃뱶 ??젣
TreeNode* deleteNode(int data,TreeNode* T){
TreeNode *search;
TreeNode *tmp = NULL;
search = T;
tmp = search;
while(search != NULL){
printf(Tree Order Starting...\n);
if(data == search-data){
printf(Child isNull \n);
if(search - right == NULL && search - left == NULL){
if(tmp - left == search){
tmp - left = NULL;
}
else{
tmp - right=NULL;
}
free(search);
break;
}
else if(search - right == NULL){
printf(Left Delete...\n);
if( tmp - left == search){
tmp - left = search - left;
}
else{
tmp - right = search - left;
}
free(search);
break;
}
else if( search - left == NULL){
printf(Right delete...\n);
if(tmp - right == search){
tmp - right = search - right;
}
else{
tmp - left = search - right;
}
free(search);
break;
}
else{
TreeNode* localTemp = search - right;
TreeNode* localPrev = search - right;
while(localTemp != NULL){
if(localTemp-left == NULL){
break;
}
else{
localPrev = localTemp;
localTemp = localTemp-left;
}
}
search - data = localTemp-data;
if(localTemp == localPrev){
if(localPrev!=NULL){
search - right = localPrev - right;
}
else{
search - right = NULL;
}
free(localTemp);
}
else{
if(localTemp-right!=NULL){
localPrev-left = localTemp-right;
}
else{
localPrev-left = NULL;
}
free(localTemp);
}
}
}
else if(search-data data){
printf(Delete Data small..\n);
tmp = search;
search = search-left;
}
else if(search-data data){
printf(Delete Data Large..\n);
tmp = search;
search = search - right;
}
else{
printf(Delete Node not found!! \n);
return NULL;
}
}
return T;
}
//?꾩쐞 ?쒗쉶
void preorder(TreeNode *ptr){
if(ptr){
printf(%3d \n,ptr-data);
preorder(ptr-left);
preorder(ptr-right);
}
}
//以묒쐞 ?쒗쉶
void inorder(TreeNode* ptr){
if(ptr){
inorder(ptr-left);
printf(%3d \n,ptr-data);
inorder(ptr-right);
}
}
//?꾩쐞 ?쒗쉶
void postorder(TreeNode* ptr){
if(ptr){
postorder(ptr-left);
postorder(ptr-right);
printf(%3d \n,ptr-data);
}
}
int main(){
TreeNode *T,*k;
int in;
T = makeRootNode();
while(1){
printf(?뺤닔?낅젰(醫낅즺:-1) :);
scanf(%d, &in);
printf(\n);
if(in == -1 ) break;
insertNode(in,T);
printf(\n preorder : );
preorder(T);
printf(\n inorder : );
inorder(T);
printf(\n postorder : );
postorder(T);
}
printf(?꾩껜 ?몃뱶 ??: %d\n,countNode(T));
&nbnbsp; printf(\n\n);
while(1){
printf(??젣???곗씠???낅젰: \n);
scanf(%d,&in);
if(in == -1){
printf(\n preOrder : );
preorder(T);
printf(\n inorder : );
inorder(T);
printf(\n postorder : );
postorder(T);
continue;
}
else if(in==-1){
break;
}
k = searchNode(in,T);
if(k){
deleteNode(k-data,T);
printf(\n preorder : \n);
preorder(T);
printf(\n inorder : \n);
inorder(T);
printf(\n postorder : \n);
postorder(T);
printf(\n);
}
else
printf(Data not found \n);
}
printf(??젣?쒗썑 ?꾩껜 ?몃뱶 ??: %d\n,countNode(T));
return 0;
}
