Consider a member method that prints the keys of a BST in a decreasing order, complete...

 

Transcribed Image Text:

Consider a member method that prints the keys of a BST in a decreasing order, complete the following code by choosing the correct answer: public void printReverse() { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 1: 2. 4. 5. 6. ... 3. recPrintReverse(root.left); recPrintReverse(root.right); None return recPrintReverse(root); recPrintReverse(root); QUESTION 12 public void printReverse () { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 2: 2.... 4. ... 5. 6. ... if(n== null) None if(n != null) if(root != null) if(root == null) 3.... QUESTION 13 public void printReverse () { } 1. ... private void recPrintReverse (BSTNode<T> n) { Line 3: 2.... 5. 6. ... None return; n = n.right; return n; O n = n.left; 3. QUESTION 14 public void printReverse() { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 4: None 2. ... 4. 5. 6. ... 3.... recPrintReverse(root); recPrintReverse(n) recPrintReverse(n.right); recPrintReverse(n.left); QUESTION 15 public void printReverse () { } private void recPrintReverse (BSTNode n) { } Line 5: 1. None 2.... 4. 5. 6. 3. System.out.println(n.left.key); System.out.println(n.key); System.out.println(root.key); System.out.println(n.right.key); QUESTION 16 public void printReverse () { 1. ... } private void recPrintReverse (BSTNode } 2. ... 4. 5. 6. 3.... Line 6: O recPrintReverse(root); O recPrintReverse(n.right); O recPrintReverse(n); O None O recPrintReverse(n.left); n) { QUESTION 17 I else H return 0; J public int f() { return rec_f(root); } private int rec_f (BTNode<T> t) { if (t == null) what is the result of running f() on the binary tree in Figure 1 if (t.right != null && t.left != null) O 11 0 5 return 1+rec_f(t.right)+rec_f(t.left); G Figure 1: Binary tree return rec_f(t.right)+rec_f(t.left); } K A E D FL T B Consider a member method that prints the keys of a BST in a decreasing order, complete the following code by choosing the correct answer: public void printReverse() { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 1: 2. 4. 5. 6. ... 3. recPrintReverse(root.left); recPrintReverse(root.right); None return recPrintReverse(root); recPrintReverse(root); QUESTION 12 public void printReverse () { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 2: 2.... 4. ... 5. 6. ... if(n== null) None if(n != null) if(root != null) if(root == null) 3.... QUESTION 13 public void printReverse () { } 1. ... private void recPrintReverse (BSTNode<T> n) { Line 3: 2.... 5. 6. ... None return; n = n.right; return n; O n = n.left; 3. QUESTION 14 public void printReverse() { 1. ... } private void recPrintReverse (BSTNode<T> n) { } Line 4: None 2. ... 4. 5. 6. ... 3.... recPrintReverse(root); recPrintReverse(n) recPrintReverse(n.right); recPrintReverse(n.left); QUESTION 15 public void printReverse () { } private void recPrintReverse (BSTNode n) { } Line 5: 1. None 2.... 4. 5. 6. 3. System.out.println(n.left.key); System.out.println(n.key); System.out.println(root.key); System.out.println(n.right.key); QUESTION 16 public void printReverse () { 1. ... } private void recPrintReverse (BSTNode } 2. ... 4. 5. 6. 3.... Line 6: O recPrintReverse(root); O recPrintReverse(n.right); O recPrintReverse(n); O None O recPrintReverse(n.left); n) { QUESTION 17 I else H return 0; J public int f() { return rec_f(root); } private int rec_f (BTNode<T> t) { if (t == null) what is the result of running f() on the binary tree in Figure 1 if (t.right != null && t.left != null) O 11 0 5 return 1+rec_f(t.right)+rec_f(t.left); G Figure 1: Binary tree return rec_f(t.right)+rec_f(t.left); } K A E D FL T B

Answer rating: 100% (QA)

The detailed answer for the above question is provided below answers 11code public void printReverse ... View the full answer