Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
void print(int x,int y)
ReplyDelete{
int i =x;
LABEL:
printf("%d\n",i++);
if(i>y)
return;
else
goto LABEL;
}
#include
ReplyDeleteusing namespace std;
void print_100(int n)
{
if(n<0)
return;
print_100(n-1);
cout<<n;
}
int main()
{
print_100(100);
return 0;
}
@ankit yes it will work fine..:)
ReplyDelete