Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/kovs705/swift-computerscience

My path in CS (in Swift) using this roadmap: https://roadmap.sh/computer-science
https://github.com/kovs705/swift-computerscience

computer-science swift

Last synced: 10 days ago
JSON representation

My path in CS (in Swift) using this roadmap: https://roadmap.sh/computer-science

Awesome Lists containing this project

README 

        
# Table of Contents



* [Computer Science Roadmap](#computer-science-roadmap)

* [Data Structures](#data-structures)

  * [Linked list](#linked-list)

  * [Stack](#stack)

  * [Queue](#queue)

  * [Hash Table](#hash-table)

  * [Trees](#trees)

  * [Graphs](#graphs)



## Computer Science Roadmap



My path in CS using this roadmap: [Computer Science Roadmap](https://roadmap.sh/computer-science)



## Data Structures



Data Structure is a way of organizing the data in the memory so that it can be used efficiently. Some common data structures are array, linked list, stack, hashtable, queue, tree, heap, and graph.



### Linked list

A linked list in Swift is a collection of values arranged in a linear unidirectional sequence. It is composed of nodes, where each node holds a value and a reference to the next node in the sequence. When the end of the list is reached, the reference is usually set to nil

Example in Swift.



[Example](./Examples/LinkedList.swift)



### Stack

Stack is a linear collection of items where items are inserted and removed in a particular order. Stack is also called a LIFO Data Structure because it follows the “Last In First Out” principle i.e. the item that is inserted in the last is the one that is taken out first.



There's no built-in stack in Swift, but you can make your own: [Example](./Examples/Stack.swift)



### Queue

Queue is a linear collection of items where items are inserted and removed in a particular order. The queue is also called a FIFO Data Structure because it follows the “First In, First Out” principle i.e., the item that is inserted in the first is the one that is taken out first.



[Example](./Examples/Queue.md)



### Hash Table

A hash table is a data structure that stores key-value pairs and allows for fast retrieval of values based on their keys. In Swift, the equivalent of a hash table is a Dictionary. Swift dictionaries are collections of key-value pairs where each key is associated with a value



[Example](./Examples/Dictionary.md)



## Trees

[Trees, author - Paul Hudson](https://www.hackingwithswift.com/plus/data-structures/trees)



A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value and a list of references to other nodes (the “children”).



[Example and Info](./Examples/Trees/BinaryTree.md)



### Full binary tree

A full binary tree is a type of binary tree in which every node has either zero or two children. 

This means that all the nodes in the tree are either leaf nodes (nodes without children) or internal nodes (nodes with children). 

It's commonly used in binary decision-making algorithms, as every node contains two paths, either a "yes" or a "no."



[Example](./Examples/Trees/FullBinaryTree.md)



### Complete Binary Tree

A complete binary tree is a special type of binary tree where all the levels of the tree are filled completely except the lowest level nodes which are filled from as left as possible.



[Example](./Examples/Trees/CompleteBinaryTree.md)



### Balanced Tree

A balanced binary tree is a binary tree in which the height of the left and right subtree of any node differ by not more than 1.



[Example](./Examples/Trees/BalancedTree.md)



## Graphs

[Link to Graphs folder](https://github.com/kovs705/Swift-ComputerScience/tree/main/Graphs)