We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 84604b3 + 948ee1e commit ce1099dCopy full SHA for ce1099d
Trees/average of each level
@@ -0,0 +1,31 @@
1
+vector<double> averageOfLevels(TreeNode* root)
2
+ {
3
+ vector<double>v;
4
+ double sum=0;
5
+ double count=0;
6
+ queue<TreeNode*>q;
7
+ q.push(root);
8
+ while(q.empty()==false)
9
10
+ int size=q.size();
11
+ count=size;
12
+ sum=0;
13
+ for(int i=0;i<size;i++)
14
15
+ TreeNode*curr=q.front();
16
+ sum=sum+curr->val;
17
+ q.pop();
18
+ if(curr->left!=NULL)
19
20
+ q.push(curr->left);
21
+ }
22
+ if(curr->right!=NULL)
23
24
+ q.push(curr->right);
25
26
27
+ v.push_back(sum/count);
28
29
+ return v;
30
31
+};
0 commit comments