题解 | #完全二叉树结点数#
完全二叉树结点数
https://www.nowcoder.com/practice/512688d2ecf54414826f52df4e4b5693
public class Solution {
public int nodeNum(TreeNode head) {
if(head == null) {
return 0 ;
}
return nodeNum(head.left) + nodeNum(head.right) + 1 ;
}
}
查看8道真题和解析
投递微软等公司10个岗位 >
