[자료구조, c] Binary Search Tree 프로그램

소개글

[자료구조, c] Binary Search Tree 프로그램에 대한 보고서 자료입니다.

본문내용

#include
#include
#include

#define IS_FULL(ptr) (!(ptr))

typedef struct node *tree_pointer;
typedef struct node {
tree_pointer left_child;
int data;
tree_pointer right_child;
};

int cnt = 0;
tree_pointer ptr = NULL;

void printMenu();

/* 1. Insert */
void insert_node ( tree_pointer *node, int num );
tree_pointer modified_search1 ( tree_pointer tree, int key );
void insertProc(tree_pointer * tree);

/* 2. Search */
tree_pointer search(tree_pointer root, int key);
void searchProc(tree_pointer tree);

/* 3. Rank_Search */
tree_pointer rank_search(tree_pointer root, int rank);
void rank_searchProc(tree_pointer tree);

/* 4. Delete */
void delete_node(tree_pointer *tree, int key);
int search_delete_max(tree_pointer *tree);
void deleteProc(tree_pointer *tree);

키워드

binary,   search,   tree,   c,   바이너리서치,   바이너리,   이진검색,   이진트리