|
#include<stdio.h>
#include<stdlib.h>
typedef struct tree_node *tree_pointer;
typedef struct tree_node {
int Key;
tree_pointer left;
tree_pointer right;
}tree_node;
void insertToBT(tree_pointer *ptr, int num) ;
tree_pointer binary_search(tree_pointer ptr, int key);
void inOrderT
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define TRUE 1
#define FALSE 0
typedef struct BST {
int data;
struct BST *left;
struct BST *right;
} BST;
BST *make_node();
BST *init_BST(int);
int insert_BST(BST *, int);
int search
|
|
|
;
}
else if (array[middle]> value)
last = middle -1;
else first = middle +1;
}
return position;
}
|
|
|
|
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
|
|
|
과정을 수행하고 가운데 값보다 크면 오른쪽 영역으로 가서 또다시 수행한다. 이를 값을 찾거나 더 이상 분할할 항목이 없을 때까지 반복한다.
void binSearch(int size, const int S[], int target, int &location)
{
int low, high, mid;
low = 0;
high = size - 1;
location = 0;
|
|
메뉴펼치기
