// Define your Node class here
}

private Node root; // Assuming you have a root node in your BinaryTree class

public int countOneChildLeaf() {
return countOneChildLeafNodes(root);
}

private int countOneChildLeafNodes(Node node) {
// Implement your recursive logic here
if (node == null) {
return 0;
}

// Your logic to count nodes with one child or leaf nodes
int count = 0;
if ((node.left == null && node.right != null) || (node.left != null && node.right == null)) {
count++;
}

// Recursive calls for left and right children
count += countOneChildLeafNodes(node.left);
count += countOneChildLeafNodes(node.right);