Difference between revisions of "W3151 Trees"
From Coder Merlin
Tatsat-jha (talk | contribs) (Add topic headers to be discussed) |
Tatsat-jha (talk | contribs) |
||
| Line 21: | Line 21: | ||
== Exercises == | == Exercises == | ||
== References == | == References == | ||
https://www.raywenderlich.com/1053-swift-algorithm-club-swift-tree-data-structure | * https://www.raywenderlich.com/1053-swift-algorithm-club-swift-tree-data-structure | ||
https://en.wikipedia.org/wiki/Tree_(data_structure) (Wiki) | * https://en.wikipedia.org/wiki/Tree_(data_structure) (Wiki) | ||
* https://www.geeksforgeeks.org/applications-of-tree-data-structure/ (GeeksforGeeks) | |||
Revision as of 11:31, 19 January 2022
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
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.
