import java.util.LinkedList; public class IntTree {     private Node root;     private static class Node {         public int key;         public Node left, right;         public Node(int key) {             this.key = key;         }     }     public void printInOrder() {         printInOrder(root);     }     private void printInOrder(Node n) {         if (n == null)             return;         printInOrder(n.left);         System.out.println(n.key);         printInOrder(n.right);     } /*      * Returns the number of nodes in the tree "above" depth k. Do not include nodes      * at depth k. For example, given BST with level order traversal 50 25 100 12 37      * 150 127 the following values should be returned t.sizeAboveDepth(0) == 0      * t.sizeAboveDepth(1) == 1 [50] t.sizeAboveDepth(2) == 3 [50, 25, 100]      * t.sizeAboveDepth(3) == 6 [50, 25, 100, 12, 37, 150] t.sizeAboveDepth(k) == 7      * for k >= 4 [50, 25, 100, 12, 37, 150, 127]      */     public int sizeAboveDepth(int h) {         // TODO         throw new RuntimeException("Not implemented");     }   • You are not allowed to use any kind of loop in your solutions.  • You may not modify the Node class in any way • You may not modify the function headers of any of the functions already present in the file. • You may not add any fields to the IntTree class.

import java.util.LinkedList;

public class IntTree {
    private Node root;

    private static class Node {
        public int key;
        public Node left, right;

        public Node(int key) {
            this.key = key;
        }
    }

    public void printInOrder() {
        printInOrder(root);
    }

    private void printInOrder(Node n) {
        if (n == null)
            return;
        printInOrder(n.left);
        System.out.println(n.key);
        printInOrder(n.right);
    }

/*
     * Returns the number of nodes in the tree "above" depth k. Do not include nodes
     * at depth k. For example, given BST with level order traversal 50 25 100 12 37
     * 150 127 the following values should be returned t.sizeAboveDepth(0) == 0
     * t.sizeAboveDepth(1) == 1 [50] t.sizeAboveDepth(2) == 3 [50, 25, 100]
     * t.sizeAboveDepth(3) == 6 [50, 25, 100, 12, 37, 150] t.sizeAboveDepth(k) == 7
     * for k >= 4 [50, 25, 100, 12, 37, 150, 127]
     */
    public int sizeAboveDepth(int h) {
        // TODO
        throw new RuntimeException("Not implemented");
    }

• You are not allowed to use any kind of loop in your solutions. 
• You may not modify the Node class in any way
• You may not modify the function headers of any of the functions already present in the file.
• You may not add any fields to the IntTree class.