Java

Write a method that receives a reference to the root of a B-tree T and an integer d and prints, in descending order, all the keys that are stored in nodes at depth d in the tree.

public class BTreeNode f private int ti public int n; public boolean isLeaf: I/ Boolean indicator public inti key public BTreeNode [l c I/ Children of node. Keys in clil are less than keyli (if it exists) /I BTree parameter, each node has at least t-1 and at most 2t-1 keys / Actual number of keys on the node // Keys stored in the node. They are sorted ion aacending arder // and greater than key[i+1] if it exists public BTreeNode (int t / Build empty node this.t-ti isLcaf -true: key new int[2*t-1 / Array sizes are set to maximum possible value c new BTreeNode [2*t]; // Number of elements is zero, since node is empty public boolean isFull)f return n--key.length; public int height if(isLeaf) return 0; return 1+c[0] height public void print)[ //Prints all keys in the tree in ascending order if (isLeaf) for {int i =0; ikey[i]) i4+ return false; else return clil.find (k); return true; //k key[i] publie void insert (int newkay) ( // Instert new key to current node // We make sure that the current node is not full by checking and // splitting if necessary before descending to node //System.out.printin("inserting "newKey) I Debugging code int i-n-l; iE (isLeaf) ( while ((?>-0)&& (newkeyckey[])) { // Shift key greater than newKey to left key [i+1] -key [i]; // Update number of keys in node keyi+1]-newkey Insert new key elsel while ((i-0) (newKey