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.
1 parent 432119f commit 5fe74a2Copy full SHA for 5fe74a2
tree_problems/sumTree.cpp
@@ -4,11 +4,11 @@
4
* An empty tree is SumTree and sum of an empty tree can be considered as 0.
5
* A leaf node is also considered as SumTree.
6
*
7
- * 26
8
- * / \
9
- * 10 3
10
- * / \ \
11
- * 4 6 3
+ * 26
+ * / \
+ * 10 3
+ * / \ \
+ * 4 6 3
12
*/
13
#include <iostream>
14
@@ -63,11 +63,11 @@ void inorder(Node * root)
63
int main()
64
{
65
/**
66
67
68
69
70
71
72
Node * root = new Node(26);
73
root->left = new Node(10);
0 commit comments