How do you delete the node of a tree with edge cases applied to it ..

`struct tree{ int element; tree *left; tree *right; }; tree *Delete(int x, tree *s){ tree *temp; if(s==NULL) cout<<“Element not found”<<endl; else if(x<s->element) s->left=Delete(x, s->left); else if(x>s->element) s->right=Delete(x, s->right); else if(s->left&&s->right){ temp=findmin(s->right); s->element=temp->element; s->right=Delete(s->element, s->right); } else { temp=s; if(s->left==NULL) s=s->right; else if(s->right==NULL) s=s->left; free(temp); } return s; }` I have tried AI and asked friends, […]

`struct tree{ int element; tree *left; tree *right; }; tree *Delete(int x, tree *s){ tree *temp; if(s==NULL) cout<<“Element not found”<<endl; else if(x<s->element) s->left=Delete(x, s->left); else if(x>s->element) s->right=Delete(x, s->right); else if(s->left&&s->right){ temp=findmin(s->right); s->element=temp->element; s->right=Delete(s->element, s->right); } else { temp=s; if(s->left==NULL) s=s->right; else if(s->right==NULL) s=s->left; free(temp); } return s; }` I have tried AI and asked friends, […]

/**

I want to write a program in c++. In the input, in first line, two integers N(number of nodes) and P(destination node) are given. Then, in second line, those N nodes are given.

I have successfully completed 9 data structure exercises in C++ but the binary search tree dsi is stumping me. After it is compiled, everything looks fine, however when i try to execute this program, it crashed.

the root is passed to the Print function, whose left and right values are Null. but the thing is, if you start looking through the debugger from the line for (size_t i = 0; i < tree.GetTreeDepth(); ++i) then you can see that the root has nodes. but when passed to the Print function, the nodes disappear again and only the value at the root remains.