Write method to count nodes on a binary tree with integer nodes that match a given values
Anonym
public int countNodes(Node node, int value) { if(node == null) return 0; int count = value == (Integer) node.data ? 1 : 0; if(node.left != null) count += countNodes(node.left, value); if(node.right != null) count += countNodes(node.right, value); return count; }