12.12 NVCC Lab: Count values in a tree Please refer to the TreeNode.java and MyTree.java and implement the method as specified below: public int countAboveBenchmark(MyTree mt, int val) This method takes a MyTree and a benchmark value (val) as parameters and count and return how many numbers in the tree are greater than or equals to the benchmark value. For example, given the following tree, [9] , [12] [15] [24] [3] / [0] calling: countAbove Benchmark(mt, 13) should return 2, because there are two numbers: 15 and 24 are greater than 13 =======TreeNode.java======= public class TreeNode implements Comparable{ private int data; private TreeNode left; private TreeNode right; public TreeNode (int data) { this.data=data; left=right=null; } public int getData() { } return data;B public TreeNode getLeft () { } return left; public TreeNode getRight () { return right;
I need help with this Java problem to output as it's explained in this image below:
This part continues after the given image below:
=======TreeNode.java======= public class TreeNode implements Comparable<TreeNode>{ private int data; private TreeNode left; private TreeNode right; public TreeNode(int data){ this.data=data; left=right=null; } public int getData(){ return data; } public TreeNode getLeft(){ return left; } public TreeNode getRight(){ return right; } public void setData(int data){ this.data = data; } public void setLeft(TreeNode left){ this.left = left; } public void setRight(TreeNode right){ this.right = right; } public int compareTo(TreeNode node){ return data-node.getData(); } } =========MyTree.java======= public class MyTree{ private TreeNode root; public MyTree(){ root=null; } public TreeNode getRoot(){ return root; } //all other methods are omitted }
public class Main{
public int countAboveBenchmark(MyTree mt, int val){
//TO DO: count and return how many numbers in the tree are greater than or equals to the benchmark value.
}
}
![12.12 NVCC Lab: Count values in a tree
Please refer to the TreeNode.java and MyTree.java and implement the method as specified below:
public int countAboveBenchmark(MyTree mt, int val)
This method takes a MyTree and a benchmark value (val) as parameters and count and return how many numbers in the tree are greater
than or equals to the benchmark value.
For example, given the following tree,
[9]
,
[12]
[15]
[24]
[3]
/
[0]
calling: countAbove Benchmark(mt, 13) should return 2, because there are two numbers: 15 and 24 are greater than 13
=======TreeNode.java=======
public class TreeNode implements Comparable<TreeNode>{
private int data;
private TreeNode left;
private TreeNode right;
public TreeNode (int data) {
this.data=data;
left=right=null;
}
public int getData() {
}
return data;B
public TreeNode getLeft () {
}
return left;
public TreeNode getRight () {
return right;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4e135d5c-f867-4afd-9f0d-b505f4f19664%2F79fe2dbf-4c0f-456d-9851-ad4211c6c477%2Fr4v2kv_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 4 images
