Jump to content

Talk:Tree from nesting levels: Difference between revisions

Talk:Tree from nesting levels (view source)

Revision as of 11:39, 8 February 2021

26 bytes added ,  3 years ago
m
→‎Updated nested tuple data structure - see functional Python on main page for tree diagrams
Line 87:
We can obtain a self-consistent representation of these forests as lists of tuples, in which the first value is a kind of sum type (Int or None), and the second value is itself a (possibly empty) forest:
 
<lang python>(None, [])
[(None, [(1, [(2, [(None, [(4, [])])])])]])
[(None, [(None, [(None, [(3, [])])])], [(1, [(None, [(3, [])])])], [(1, [])]])
[(None, [(1, [(2, [(3, [])])])], [(1, [])]])
[(None, [(None, [(None, [(3, [])]), (2, [])])], [(1, [(None, [(3, [])])])]])
[(None, [(None, [(None, [(3, []), (3, []), (3, [])])])], [(1, [])], [(1, [(None, [(3, []), (3, []), (3, [])])])]])</lang>
[[User:Hout|Hout]] ([[User talk:Hout|talk]]) 14:00, 4 February 2021 (UTC)
 
Hout
9,655

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/307483"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information