Problem #1: In this problem, you will write some Java code for a simple operatio

Question

Problem #1: In this problem, you will write some Java code for a simple operation on binary search trees where keys are integers. Assume you already have the following code. public class Binar Noge public int key; public BinaryNode left; public BinaryNode right; Write a method in Java that takes as input a binary search tree, and two integer values, lower and upper, which are ordered so that lower upper, and prints all elements in the binary search tree such that lower S key s upper. Note: Your program should run in O(K +logN) average time, where K is the number of keys printed. Use the following method signature: static void printRange(int lower, int upper, BinaryNode t)

Explanation / Answer

    static void printRange(int lower, int upper, Binaryt t) {
        if (t == null) {
            return;
        }
        if (lower < t.key) {
            printRange(lower, upper, t.left);
        }
       if (lower <= t.key && upper >= t.key) {
            System.out.print(t.key + " ");
        }
       if (upper > t.key) {
            printRange(lower, upper, t.right);
        }
    }

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.