Timeline for Deleting a node from a binary search tree
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2015 at 5:04 | comment | added | Jayesh | nicely explained: javabypatel.blogspot.in/2015/08/… | |
| Jul 9, 2014 at 16:10 | history | edited | Jamal | CC BY-SA 3.0 | added 5 characters in body; edited tags; edited title |
| Apr 22, 2013 at 18:24 | answer | added | Yi-An | timeline score: 2 | |
| Jul 24, 2012 at 6:54 | history | edited | svick | CC BY-SA 3.0 | shorter title |
| Jul 6, 2012 at 7:02 | answer | added | ROBOKiTTY | timeline score: 8 | |
| Jul 2, 2012 at 21:28 | comment | added | daydreamer | correctness of program is what I am interested in :). thnks for your edit | |
| S Jul 2, 2012 at 21:27 | history | suggested | Adam | CC BY-SA 3.0 | fixed to satisfy compiler |
| Jul 2, 2012 at 21:19 | comment | added | Adam | I've proposed an edit, but that still needs to be accepted by a mod. Note that though this satisfies the compiler, I by no means have any idea whether it actually runs properly. | |
| Jul 2, 2012 at 21:18 | review | Suggested edits | |||
| S Jul 2, 2012 at 21:27 | |||||
| Jul 2, 2012 at 21:14 | comment | added | daydreamer | sure, would like to see the version | |
| Jul 2, 2012 at 21:14 | comment | added | Adam | the faq requires real code as opposed to pseudo-code. And even as pseudo-code, leaving out the returns makes no sense. If you like I'll paste in a compiling version of your code... | |
| Jul 2, 2012 at 21:12 | comment | added | daydreamer | ahh @codesparkle, this is just a pesudo code, I am sorry not being specific | |
| Jul 2, 2012 at 21:00 | comment | added | Adam | there are compile errors... missing a semicolon ; after right... missing a return type (boolean) before deleteNodeBST(Node node, int value)... node == null; is a condition so it can't be used as a statement, did you mean node = null;? and the last line has to be return findMinimumAndReturnWithDelete(node.getLeft()); because all code paths have to return a value. And what the hell is node.setValue() = findMinimumAndReturnWithDelete(node.getRight());? you're assigning a value to a method? surely you meant node.setValue(findMinimumAndReturnWithDelete(node.getRight())); | |
| Jul 2, 2012 at 20:43 | history | asked | daydreamer | CC BY-SA 3.0 |