Sum at k tree recursion

#1

getting segmentation fault

#2

hi @guptashubham210a input for k is given in the end, but you are taking it in the starting itself. Do look at the input format carefully!

#3

@getting wrong output now

#4

@Ishitagambhir
@getting wrong output now

#5

@guptashubham210a https://ide.codingblocks.com/s/318119

#6

@Ishitagambhir
why this call wasn’t working?
if (k == 0)
{
return root->data;
}
return (root->left, k - 1) + sumatk(root->right, k - 1);

#7

@guptashubham210a try to dry run this for a small tree, you’ll see where this is going wrong

#8

@Ishitagambhir
I am sorry I have tried but not getting where?

#9

@guptashubham210a image
see this line carefully, can you spot the mistake now?

1 Like
#10

@Ishitagambhir
No :joy: :thinking:

#11

@guptashubham210a the function name is missing.
It should be sumatk(root->left, k-1)
instead its just (root->left, k-1)

#12

@Ishitagambhir
I am extremely sorry thats a huge blunder. :blush:

#13

@guptashubham210a dont forget to mark the doubt as resolved!