HamburgChimps/bst

An implementation of a binary search tree in c

The HamburgChimps Binary Search Tree

An implementation of a binary search tree in c.

For demonstration purposes, this repo contains a test harness and a Makefile to compile and link the BST implementation and test harness. You can then execute the test harness with /.hc_bst_test. This assumes an OS with make and gcc.

API

hc_bst_init() -> hc_bst*

Initialize a BST for usage.

hc_bst_insert(hc_bst* t, const char* k, const char* v) -> void

Insert into a BST t a node with key k and value v.

hc_bst_get(hc_bst* t, const char* k) -> const char* v

Returns the value v for the node with key k in the tree t. If the tree t does not contain the key k then this function returns NULL. This function also returns NULL if the given key k is NULL.

hc_bst_traverse(hc_bst* t, int order_flag) -> void

Traverse the given tree t in the order indicated by order_flag and print each node's key and value along the way.

Pass order_flag as -1 to execute pre-order traversal.

Pass order_flag as 0 to execute in-order traversal.

Pass order_flag as 1 to execute post-order traversal.

Pass order_flag as 2 to execute level-order (breadth-first) traversal.

Any other order_flag value will result in in the function doing nothing.

int hc_bst_get_height(hc_bst* t) -> int

Get the height of the given tree t.

hc_bst_delete_key(hc_bst* t, const char* k) -> void

Deletes the node with key k in the tree t, if it exists.

hc_bst_print(hc_bst* t) -> void

Print the contents of a BST t.

hc_bst_destroy(hc_bst** t) -> void

Destroy the given tree t.