Please enable JavaScript.
Coggle requires JavaScript to display documents.
14: Data structure (Stack (Is a lifo, Push: Puts an item at the top of the…
14: Data structure
-
Graph
Used to model: Social media, data transmission and web pages
-
-
-
-
-
-
Trees
Dynamic, efficient and can be easily restructured
-
How to insert:
-
.
Else: If new data item is less than the value go left, else go right
-
Traversal
Preorder: Goes down the left sub tree first and then right until completion. Think as if the point is to the left of the tree
Inorder: You go to the left bottom and work your way up. You then do this for the right path. OUTPUTS IN ALPHABETICS
-
Tuple
Is a group of unnamed, ordered values
-
Example: Pupil = ("jon", 17, 3/1/2003)
Name = pupil[0]
-
Hash table
-
The initial data is converted into a value which is fed to the cash function which then operates on it (eg mod 50) and generates the number
-
-
-
-
-
-