题目 code: class Solution { public int countNodes(TreeNode root) { return countNodesDg(root); } private int countNodesDg(TreeNode root) { if (root == null) { return 0; } return countNodes(root.left) + countNodes(root.right) + 1; } }