Elementary data structures and algorithms implemented in Swift language
- Binary tree
- Min heap node-based implementation (implementation from Back to Back folks)
- Pascal's triangle: produces any binomial expansion for a given coefficient. It even prints the Pascal's triangle on console formed to reach said result.
| 2nd power | 5th power | 7th power |
|---|---|---|
 |
 |
 |
graphicalRepresentation(): prints in terminal the hierarchical form of previously loaded tree in memory
