JAVA : Recursively complete the removeOddSubtrees() method using one helper function for a binary tree.

public class MyIntSET {

private Node root;

private static class Node {

public final int key;

public Node left, right;

public Node(int key) { this.key = key; }

}

// remove all subtrees with odd roots (if node is odd, remove it and its descendants)

// A node is odd if it has an odd key

// If the root is odd, then you should end up with the empty tree

public void removeOddSubtrees () {

// TODO

}