Talk:Tree datastructures: Difference between revisions
Content added Content deleted
(And when comparison has children?) |
|||
| Line 35: | Line 35: | ||
==And when comparison has children?== |
==And when comparison has children?== |
||
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:03, 16 October 2019 (UTC) |
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:03, 16 October 2019 (UTC) |
||
Depends, of course, on the implementation of equality in each. For JS I have had to hand-write a recursive '''eq'''. Haskell Data.Tree includes an instance for the Eq class. Python's (==) equality is recursive out of the box. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 13:27, 16 October 2019 (UTC) |
|||