Architecture
Intermediate
Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps
Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps
4.0
(1 reviews)
1
Students
4
Lessons
ID
Language
Created by
Mary Hudachek-Buswell
Language
id
Translations
None
Transcripts
English
Prerequisites
None
What you'll learn
Master these skills and apply them to real-world projects.
Develop mature Java programming skills by using recursion in Tree ADTs
Investigate different nonlinear, linked data structures: Trees, Heaps, SkipLists and HashMaps
Study the significant uses and applications of hierarchical tree structures
Explore tree properties, and categorizing based on shape and order
Design and implement the binary trees: BSTs and Heaps
Examine edge cases and efficiencies in BST and Heap operations
Understand the up-heap, down-heap and build-heap procedures
Consider the probabilistic data structure, SkipLists, and randomization
Implement a HashMap ADT with its key-value pairs
Analyze the different collision strategies with HashMaps
Compute amortized analysis for Heaps and HashMaps
Course curriculum
2 sections · 4 lessons
2
Sections
4
Lessons
1
Reviews
1
Students
4.0
Rating
Materi 2.1: Possimus eveniet adipisci voluptas.
Materi 2.2: Optio iure sit rerum cum.
About this course
Course description
Meet your instructor
Learn from an industry expert
Mary Hudachek-Buswell
Associate Chair, School of Computing Instruction at Georgia Institute of Technology
Student reviews
What learners say about this course
"Molestiae necessitatibus ut reiciendis non ut quas quis nesciunt doloremque est officiis."
The benefits of Coursify courses
Pay less, earn more
Programs dig deeper into your chosen subject and are offered at a special price.
Earn certificates
When you're done, you'll have multiple certificates to add to your resume.
Learn 100% online
Learn on your own schedule from anywhere in the world.