Timeline for Generic Queue data structure in C++
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2018 at 23:17 | comment | added | JDługosz |
Your do_unchecked_pop function is written to look specifically at the head. I don’t know what you are asking.
|
|
| Jul 5, 2018 at 23:30 | comment | added | Snorrlaxxx | I meant deleting a tail not a list. Could we use unchecked_pop() to delete a tail in a single linked list? | |
| Jul 5, 2018 at 16:30 | comment | added | JDługosz |
To delete a list, you do not need to use recursion — just use a while loop.
|
|
| Jul 3, 2018 at 20:49 | comment | added | Snorrlaxxx | for the do_unchecked_pop() could that code be applied for deleteTail() for a single linked list or no? | |
| Jul 3, 2018 at 17:59 | vote | accept | Snorrlaxxx | ||
| Jul 2, 2018 at 19:03 | comment | added | JDługosz |
!empty() — Even better!
|
|
| Jul 1, 2018 at 21:48 | comment | added | Snorrlaxxx | Thank you very much, I am glad you can see improvement in my programming. For the explicit comparison against nullptr, instead can I just my empty() function instead? So essentially, !empty() instead of first != nullptr. | |
| Jul 1, 2018 at 21:27 | history | answered | JDługosz | CC BY-SA 4.0 |