Talk:Doubly-linked list/Definition: Difference between revisions
Content added Content deleted
(Task definition is unclear?) |
|||
| Line 13: | Line 13: | ||
:Yes. Feel free to merge. Same with the Singly-linked list tasks. --[[User:IanOsgood|IanOsgood]] 14:26, 16 May 2009 (UTC) |
:Yes. Feel free to merge. Same with the Singly-linked list tasks. --[[User:IanOsgood|IanOsgood]] 14:26, 16 May 2009 (UTC) |
||
==Task definition is unclear?== |
|||
What does it mean "The structure should not allow circular loops"? To me, it's the design of data structure, which should support that; however, I seem to see in the some examples that it's the attached code which takes care about that. |
|||
And the code itself, by the way, isn't required by this task, though it would clearly be useful to have data structures together with associated code for working with them. Should we update the task definition (and possibly make existing examples invalid)?[[User:Avmich|Avmich]] 01:36, 12 November 2009 (UTC) |
|||