Project 2 Solution

Implement a function




int count keys(tree node t *tree, key t a, key t b);







that counts the keys x with a ≤ x ≤ b in the leaf nodes of the given search tree. The function should work with the given code for a height-balanced tree. Do not include the code of the height-balanced tree in your submission; submit only the code you wrote yourself.




Submit your source code by e-mail to phjmbrass@gmail.com; include the course




and homework number in the subject line, and your name as a comment in the homework file.