Appendix 2 - Generic BST Implementation Solution

You will find a reference solution for implementing operations on generic binary search trees in the code widget below.

Note: This is only one possible solution. There are multiple ways of implementing these algorithms. For some algorithms, we provide multiple implementations.

Please ensure you gave the tasks a fair try and allocated enough time before giving up and reading the solutions below.

The generic BST algorithms are inside the generic_bst.h file. In main.c, you can see examples of helper functions for various data types.