Algorithms_in_C
1.0.0
Set of algorithms implemented in C.
|
11 #define MAXELEMENTS 1000
23 void *elements[MAXELEMENTS];
26 int number_of_elements;
42 int add_item_label(
Dictionary *,
char label[],
void *);
48 int add_item_index(
Dictionary *,
int index,
void *);
void delete_bt(node **root, int ele)
Definition: threaded_binary_trees.c:173
Definition: prime_factoriziation.c:25
Definition: binary_search_tree.c:14
int data
Definition: threaded_binary_trees.c:28
struct Node * rlink
Definition: threaded_binary_trees.c:30
Definition: threaded_binary_trees.c:27
void postorder_display(node *curr)
Definition: threaded_binary_trees.c:143
void search(node *root, int ele)
Definition: threaded_binary_trees.c:98
struct Node * llink
Definition: threaded_binary_trees.c:29
void preorder_display(node *curr)
Definition: threaded_binary_trees.c:157
int main(int argc, char **argv)
Definition: c_atoi_str_to_integer.c:70
void inorder_display(node *curr)
Definition: threaded_binary_trees.c:129
node * create_node(int data)
Definition: threaded_binary_trees.c:38
#define max(a, b)
Definition: kohonen_som_topology.c:31
void insert_bt(node **root, int data)
Definition: threaded_binary_trees.c:51
int main()
Definition: threaded_binary_trees.c:255