Difference between revisions of "W3152 Binary Trees"
From Coder Merlin
Tatsat-jha (talk | contribs) (Set up initial structure of page) |
Tatsat-jha (talk | contribs) (→Introduction: Add introduction) |
||
| Line 5: | Line 5: | ||
* [[W3151 Trees]] | * [[W3151 Trees]] | ||
== Introduction == | == Introduction == | ||
'''Binary Trees''' are a specific version of the '''General Tree'''. They're used to represent hierarchical data and can provide very fast timings for operations such as insertion, deletion, searching etc. The difference between the General Tree and a Binary Tree is that a Node within a Binary Tree can have 0, 1, or 2 '''Child Nodes'''. Its limit to having only two child Nodes is why it's called a Binary Tree. | |||
In the following, you'll learn the Structure of a Binary Tree, learn its implementation in Swift, and how to perform several essential operations on a Binary Tree. | |||
== Structure == | == Structure == | ||
Revision as of 09:28, 23 January 2022
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Prerequisites[edit]
Introduction[edit]
Binary Trees are a specific version of the General Tree. They're used to represent hierarchical data and can provide very fast timings for operations such as insertion, deletion, searching etc. The difference between the General Tree and a Binary Tree is that a Node within a Binary Tree can have 0, 1, or 2 Child Nodes. Its limit to having only two child Nodes is why it's called a Binary Tree.
In the following, you'll learn the Structure of a Binary Tree, learn its implementation in Swift, and how to perform several essential operations on a Binary Tree.
Structure[edit]
Usages[edit]
Complexities[edit]
Swift Implementation[edit]
Key Concepts[edit]
Key Concepts
Exercises[edit]
Exercises
