Python-based Tree Data Structure: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A Python-based Tree Data Structure is a tree data structure that is a Python data structure. * <B>Example(s):</B> ** <code>def tree(): return defaultdict(tree)</c...") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
** a [[Scala Tree Data Structure]]. | ** a [[Scala Tree Data Structure]]. | ||
* <B>See:</B> [[Scala Graph Data Structure]], [[Python Variable]]. | * <B>See:</B> [[Scala Graph Data Structure]], [[Python Variable]]. | ||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | |||
Latest revision as of 04:59, 6 January 2023
A Python-based Tree Data Structure is a tree data structure that is a Python data structure.
- Example(s):
def tree(): return defaultdict(tree)[1].- http://interactivepython.org/runestone/static/pythonds/Trees/bst.html
- Counter-Example(s):
- See: Scala Graph Data Structure, Python Variable.