PYTHON 3 LANGUAGE, USING RECURSION ONLY

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 ....3 3 ....3 ..2 ......2 ....3 

def count(t,value): pass