第一次:
想着用层次遍历 但是出错了 错误原因:超出时间限制
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int countNodes(TreeNode* root) {
queue <TreeNode* > q;
int i=1;
if(root==NULL)
{
return 0;
}
q.push(root);
while(!q.empty())
{
if(q.front()->left)
{
q.push(q.front()->left);
i++;
}
if(q.front()->right)
{
q.push(q.front()->right);
i++;
}
}return i;
}
};
然后第二次:但是电脑没电了 教室里的插头都被手机插完了 充电头太大
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int countNodes(TreeNode* root) {
if(root==NULL)
{
return 0;
}
int left_depth=0;
int right_depth=0;
TreeNode* left=root->left;
TreeNode* right=root->right;
while(left)
{
left_depth++;
left=left->left;
}
while(right)
{
right_depth++;
right=right->right;
}
if(left_depth==right_depth)
{
return pow(2,left_depth+1)-1;
}else
{
return countNodes(root->left)+countNodes(root->right)+1;
}
}
};
时间复杂度为O(n的平方)
空间复杂度为O(n)