algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #975 from chenmo1995/patch-1

Browse Source 
Update 0222.完全二叉树的节点个数.md
This commit is contained in:
程序员Carl
2022-01-06 10:01:07 +08:00
committed by GitHub
parent ab26823862 f2a1ad632f
commit e8046b657e
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0222.完全二叉树的节点个数.md
View File

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