IN PYTHON:

-------------------------

def count(t,value): pass

4. (4 pts) Write the recursive function count; it is passed balanced binary (any binary tree, not necessarily a binary search tree) and a value as arguments. It returns the number of times the values is in the tree. In the binary tree below, count (tree, 1) returns 1, count (tree, 2) returns 2, count (tree,3) returns 4 .1 .2 .3 Hint: use the 3 proof rules to help synthesis your code