Python language

5. Write a function that receives a reference to the root of a binary tree and an integer d and returns the sum of all the 6. Write a function that receives a reference to the root of a binary search tree and returns the largest element in the tree. 7. Write a function that receives a reference to the root of a binary search tree and an integer d and returns the largest 8. Write a function that receives a reference to the root of a binary search tree and an integer k and counts how many node values in the tree that have depth d What is the running time of your function? What is the running time of your function if the tree is balanced? element in the tree that has depth d. What is the running time of your function? items in the tree are greater than or equal to k. What is the running time of your function