Update 0222.完全二叉树的节点个数.md

This commit is contained in:
沉默
2021-12-30 14:32:20 +08:00
committed by GitHub
parent 76df79a8c9
commit f2a1ad632f

View File

@ -80,7 +80,7 @@ return treeNum;
class Solution {
private:
int getNodesNum(TreeNode* cur) {
if (cur == 0) return 0;
if (cur == NULL) return 0;
int leftNum = getNodesNum(cur->left); // 左
int rightNum = getNodesNum(cur->right); // 右
int treeNum = leftNum + rightNum + 1; // 中