Question

Feedback X290: Binary Tree Get Difference Exercise Your answer could not be processed because it contains errors: The solution is not recursive Given a binary tree, write a recursive function to return the difference between the sum of all node values at odd levels and sum of all node values at even levels. Define the root node to be at level 1. Here are methods that you can use on the BinNode objects: interface Bin Node { public int value(); public void setValue(int v); public Bin Node left(); public Bin Node right(); public boolean is Leaf(); 1 public int BTgetDiff(BinNode root) { if (root == null) return 0; 4 return root.value) - BTgetDiff(root.left()) - 5 BTgetDiff(root.right()); covun Check my answer! Reset

Answer 1

$\small \color{blue}Answer:\;\;$

public int BTgetdiff(BinNode root) {
    if (root == null) {
        return 0;
    } else {
        return root.value() - (BTgetdiff(root.left()) + BTgetdiff(root.right()));
    }
}

$\color{blue}Please\;let\;me\;know\;if\;you\;have\;any\;doubts\\ Please\;upvote\;this\;answer.\;\;Thanks!!$