okay, what output are you getting?

dude, to a paste bin, not a description

https://pastebin.com/uxyWhQwy this is the first time i post a code in Pastebin. sorry about that. i forgot it :)

+ / \ / \ * 2 / \ / \ 3 4 if you want to have this tree you should also create five tree nodes instead of three, e.g. struct TREE *N2 = make_node(integer, NULL, NULL, "2"); struct TREE *N3 = make_node(integer, NULL, NULL, "3"); struct TREE *N4 = make_node(integer, NULL, NULL, "4"); struct TREE *NMul = make_node(multi, N3, N4, "*"); struct TREE *NPlus = make_node(plus, NMul, N2, "+"); I don't know how you expect the output to look like, but by printing the value of n instead of its operation you can get something like this (null) 3 (null) (null) 4 (null) 3 * 4 (null) 2 (null) * + 2 Make sure to initialize the local variables, otherwise you'll likely end up printing garbage for the leave nodes char *left_value = NULL; char *right_value = NULL; https://godbolt.org/z/Y7x8zz

+ / \ / \ * 2 / \ / \ 3 4 if you want to have this tree you should also create five tree nodes instead of three, e.g. struct TREE *N2 = make_node(integer, NULL, NULL, "2"); struct TREE *N3 = make_node(integer, NULL, NULL, "3"); struct TREE *N4 = make_node(integer, NULL, NULL, "4"); struct TREE *NMul = make_node(multi, N3, N4, "*"); struct TREE *NPlus = make_node(plus, NMul, N2, "+"); I don't know how you expect the output to look like, but by printing the value of n instead of its operation you can get something like this (null) 3 (null) (null) 4 (null) 3 * 4 (null) 2 (null) * + 2 Make sure to initialize the local variables, otherwise you'll likely end up printing garbage for the leave nodes char *left_value = NULL; char *right_value = NULL; https://godbolt.org/z/Y7x8zz

free(): invalid next size (fast) Reading symbols from Solution...done. [New LWP 341797] [Thread debugging using libthread_db enabled] Using host libthread_db library "/lib/x86_64-linux-gnu/libthread_db.so.1". Core was generated by `./Solution'. Program terminated with signal SIGABRT, Aborted. #0 __GI_raise (sig=sig@entry=6) at ../sysdeps/unix/sysv/linux/raise.c:50

This code gives segmentation fault. Anyone has any idea why?

Have you tried to use debugger?

what are you trying to achieve?

I am doing a server, but the problem is when i receive a message, part of the message part stays in the socket, and when I receive other messages It show me things like a chat.zip�����

do you use TCP or UDP?

I am doing a server, but the problem is when i receive a message, part of the message part stays in the socket, and when I receive other messages It show me things like a chat.zip�����

you should use application layer protocol and read data until end of the protocol message is found

TCP does not preserve message boundaries

I need help in dynamic array in c code

I want to execute some instructions but only on the first recursive call. Therefore I used the static keyword. But the problem is there are multiple testcases(gfg) and when the function is called again, static variable execution is ignored & I cannot modify the main(). So my result is being merged with the previous result. How can I solve it ?

I want to execute some instructions but only on the first recursive call. Therefore I used the static keyword. But the problem is there are multiple testcases(gfg) and when the function is called again, static variable execution is ignored & I cannot modify the main(). So my result is being merged with the previous result. How can I solve it ?

do not use static, use function argument

Do you have some trash in socket after job is done? Or looking for way to compile whole message from pieces (segmentation)?

let me show you. Node* bTreeToCList(Node* root) { // I want to set these two objs. below as NULL on the first recursive call, but do it on every new function call static Node* CDLL = NULL; static Node* Rt = NULL; //end if (root) { bTreeToCList(root->left); if (!CDLL) { auto tmp = newNode(root->data); CDLL = tmp; CDLL->left = CDLL->right = CDLL; Rt = CDLL; } else { auto tmp = newNode(root->data); CDLL->right = tmp; CDLL->right->left = CDLL; CDLL = CDLL->right; Rt->left = CDLL; CDLL->right = Rt; } bTreeToCList(root->right); } return Rt; }

It was for humano.h sorry )))

can anyone tell me error in the copy constructor of the main()

can anyone tell me error in the copy constructor of the main()

I need help in dynamic array in c code

I have seen that every solution online is using extra variable to contain the same variable which is in the array for example https://github.com/hackerearthclub/CODE2RACE/blob/master/OPEN%20CHALLENGE/dynamicArray.c Here book variable doesn't needs to be created as the value is present in the array but the progrm doesn't runs without doing it

That has nothing to do with me it's someone else's solution

Is hacktoberfest a hacking challenge or coding challenge

Don't know Google it

Too lazy

I need help in dynamic array in c code

https://github.com/funcelot/c

??

what? do you need help with dynamic arrays in C? this is a C code, any questions?

say whaaat

int main() { int t=3; while(t--) { int sum; sum+=1; cout<<sum<<"\n"; } return 0; }

int main() { int t=3; while(t--) { int sum; sum+=1; cout<<sum<<"\n"; } return 0; }