Description
Explore trees, heaps, tries and graphs as a continuation of the data structures series. The curriculum includes binary trees, AVL trees and both directed and undirected graph topics.
Each major structure has a dedicated section in the available archive. The official series presents Java implementations to explain the underlying algorithms and data models.
This available collection was added to MEGA on 10 October 2021. It contains the named course version and curriculum; a recent update or complete current provider catalogue has not been verified.
What you will learn
- Implement and traverse binary trees.
- Work with AVL trees and heaps.
- Represent prefix data with tries.
- Model and traverse graphs.
- Compare directed and undirected graph structures.
Course specifications
- Publisher
- CodeWithMosh
- Instructors
- Mosh Hamedani
- Video Files
- 94
- Total Files
- 106
- Collection Added
- 2021-10-10
- Language
- English
- Duration
- 6 hours (official listing)
- Level
- Intermediate
Course topics
- 1. Getting Started
- 2. Binary Trees (73m)
- 3. AVL Trees (49m)
- 4. Heaps (53m)
- 5. Tries (46m)
- 6. Graphs (66m)
- 7. Undirected Graphs (59m)
Prerequisites
- Basic programming with variables, loops and conditional statements.
Pictures
AI Feders artworkIntroduction video
How to open the files
Open this course’s MEGA folder using the download link. Select the files or folders you need in MEGA; the course files are stored there.
The collection may contain video recordings, matching subtitles, exercises and project archives. Keep associated subtitles beside the video files.
Download resources
Choose one edition and keep its parts together. Alternate providers are available when listed.
Size
7.53 GiB
Leave a Reply
Signed-in member comments appear immediately.