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.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Concept of Threads
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education