Timeline for Recursive search on Node Tree with Linq and Queue
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2019 at 4:51 | history | edited | user73941 | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Jul 23, 2019 at 4:20 | history | edited | user73941 | CC BY-SA 4.0 |
added 22 characters in body
|
| Jul 23, 2019 at 4:09 | history | edited | user73941 | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jul 22, 2019 at 20:50 | history | edited | user73941 | CC BY-SA 4.0 |
added 908 characters in body
|
| Jul 22, 2019 at 20:45 | history | edited | user73941 | CC BY-SA 4.0 |
added 908 characters in body
|
| Jul 22, 2019 at 20:35 | comment | added | dfhwze | Node<T> can always be used as Node<object> if you need to. So making it generic can't hurt your design. | |
| Jul 22, 2019 at 20:32 | comment | added | Stacklysm | And I will remove the null check when removing nodes | |
| Jul 22, 2019 at 20:30 | comment | added | Stacklysm |
@Henrik Hansen GetChildrenRecursive() is the method I'm talking about, if you are doing this because I got something mixed up (I can't blame you), then that went completely over my head. As of the DeepCopy(Node), I removed it, there was no use to it. And I'm planning to make this a generic type, I used the object type because gave more freedom over what can be inserted in the tree.
|
|
| Jul 22, 2019 at 20:25 | history | edited | user73941 | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jul 22, 2019 at 20:18 | history | edited | user73941 | CC BY-SA 4.0 |
added 1041 characters in body
|
| Jul 22, 2019 at 20:06 | comment | added | dfhwze | I think he meant GetChildrenRecursive as search function :) btw I reached my vote limit of today :( | |
| Jul 22, 2019 at 20:03 | history | edited | user73941 | CC BY-SA 4.0 |
deleted 1039 characters in body
|
| Jul 22, 2019 at 19:56 | history | edited | user73941 | CC BY-SA 4.0 |
added 41 characters in body
|
| Jul 22, 2019 at 19:48 | history | answered | user73941 | CC BY-SA 4.0 |