#3in python please
3. (10 points) Write a function that receives a reference to the root of a binary search tree and an integer k and returns the sum of the elements in the path from the root to the node that contains k, or -1 if k is not in the tree. Assume all elements in the tree are positive. For example, for the tree from the previous question, if k 13 your
PayPal Gateway not configured
PayPal Gateway not configured