Difference between revisions of "W3151 Trees"
Tatsat-jha (talk | contribs) (Add pre-reqs, delete background info since no prior reading is needed, add Introduction) |
Tatsat-jha (talk | contribs) (Add topic headers to be discussed) |
||
| Line 7: | Line 7: | ||
== Introduction == | == Introduction == | ||
In Computer Science, Trees are a data structure that are very commonly used. At its core, the Tree is a series of nodes where each node contains some data and references one or multiple other nodes called ''Children.'' These structures are called Trees because of the visual resemblance between the data structure and a tree's roots. It's because of this that the top most Node is called the '''root.''' | In Computer Science, Trees are a hierarchal data structure that are very commonly used. At its core, the Tree is a series of nodes where each node contains some data and references one or multiple other nodes called ''Children.'' These structures are called Trees because of the visual resemblance between the data structure and a tree's roots. It's because of this that the top most Node is called the '''root.''' | ||
The use of Trees as Data Structures can be seen everywhere: file systems, relationship hierarchies, visual displays and GUIs and many more. This is why developers ought to understand this data structure and how to apply it. | The use of Trees as Data Structures can be seen everywhere: file systems, relationship hierarchies, visual displays and GUIs and many more. This is why developers ought to understand this data structure and how to apply it. | ||
== | == Structure == | ||
== Complexities == | |||
== Swift Implementation == | |||
== Beyond Basic Trees == | |||
== Key Concepts == | == Key Concepts == | ||
== Exercises == | == Exercises == | ||
Revision as of 11:30, 19 January 2022
Prerequisites[edit]
Introduction[edit]
In Computer Science, Trees are a hierarchal data structure that are very commonly used. At its core, the Tree is a series of nodes where each node contains some data and references one or multiple other nodes called Children. These structures are called Trees because of the visual resemblance between the data structure and a tree's roots. It's because of this that the top most Node is called the root.
The use of Trees as Data Structures can be seen everywhere: file systems, relationship hierarchies, visual displays and GUIs and many more. This is why developers ought to understand this data structure and how to apply it.
Structure[edit]
Complexities[edit]
Swift Implementation[edit]
Beyond Basic Trees[edit]
Key Concepts[edit]
Exercises[edit]
References[edit]
https://www.raywenderlich.com/1053-swift-algorithm-club-swift-tree-data-structure https://en.wikipedia.org/wiki/Tree_(data_structure) (Wiki)
