please give me the right solution. This is my 3rd time posting this. others have error when i run it. Please check the output when u run it.

The following Tree datatype implements a binary tree with a number in each node and leaf: (define-type Tree (leaf [val : Number]) (node [val : Number] [left : Tree] [right : Tree]))

Implement a positive-thinking function, which takes a Tree as argument and produces a new tree which removes all negative leaves from the original tree. If the resulting tree would have no nodes, return false. Hint: the total number of nodes (leaf and interior) in the resulting tree will be less than or equal to the total number of nodes in the original, minus the number of negative leaves in the original.