Question: Python language 10. Write a function that returns the number of keys in a B-tree. 11. Write a method that receives a reference to the
10. Write a function that returns the number of keys in a B-tree. 11. Write a method that receives a reference to the root of a B-tree and an integer d and returns the smallest key in the tree that has depth d, or -1 if there are no keys at depth d. 12. Write a method that receives a reference to the root of a B-tree and an integer d and returns the sum of all the keys in the tree that have depth d. 13. Write a method that receives a reference to the root of a B-tree and a key k and returns I if k is in an internal node in the tree, 0 if k is in a leaf in the tree, or -1 if k is not in the tree
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
