public static int getNumInLevel(TreeNode root, int n) {
if (root == null || n <= 0)
return 0;
if (n == 1) {
return root == null ? 0 : 1;
}
int left = getNumInLevel(root.left, n - 1);
int right = getNumInLevel(root.right, n - 1);
return left + right;
}