Question: 1.) Write the recursive function (in C ): int CountKey(treeptr *p, int keyval); that is given a (possibly empty) binary tree and returns the number

1.) Write the recursive function (in C ): int CountKey(treeptr *p, int keyval); that is given a (possibly empty) binary tree and returns the number of times a particular integer key (keyval) occurs as a leaf node. Include the declaration of any data structures. Do not write a complete program. Only the function is requested. 1.) Write the recursive function (in C ): int CountKey(treeptr *p, int keyval); that is given a (possibly empty) binary tree and returns the number of times a particular integer key (keyval) occurs as a leaf node. Include the declaration of any data structures. Do not write a complete program. Only the function is requested
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
