Question
Question: Write a recursive function to determine how many nodes in a Binary Search Tree have an even depth. Looking for feedback/corrections on the code
Question: Write a recursive function to determine how many nodes in a Binary Search Tree have an even depth.
Looking for feedback/corrections on the code I came up with below as we are not allowed to use an IDE on this one. Is it correct?
public int numEvenDepth() {
// tree is created somehow here
int depth = 1;
return numEvenDepthHelper(root, depth); }
public int numEvenDepthHelper(Node root, int depth) {
if(root == null) return 0;
int count = 0;
if(depth % 2 != 0) {
return count + numEvenDepthHelper(root.left, depth + 1);
return count + numEven Depth Helper(root.right, depth + 1); }
count++;
return count + numEvenDepthHelper(root.left, depth + 1);
return count + numEven Depth Helper(root.right, depth + 1);
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started