edX
MOOC / Non-credit
0
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms
About this course
Learn more complex tree data structures, AVL and (2-4) trees. Investigate the balancing techniques found in both tree types. Implement these techniques in AVL operations. Explore sorting algorithms with simple iterative sorts, followed by Divide and Conquer algorithms. Use the course visualizations to understand the performance.
C
67/100
CourseAsk score
- What the provider tells you
- 16/45
- Who stands behind it
- 35/35
- How complete the listing is
- 16/20
Scores how much the provider publishes and who stands behind it — not how well it is taught.
What you'll learn
- understand AVL trees and their balancing techniques
- implement operations in AVL trees
- explain and utilize 2-4 trees
- apply Divide and Conquer algorithms to sorting problems
Software Engineering
#algorithms
#data structures
#computer science
#sorting algorithms
#divide and conquer
#AVL trees
#2-4 trees
#performance visualization
#iterative sorts
$189.00
Price shown by edX — confirm on their site.
Enroll on edXYou'll be redirected to edX to complete enrollment.
- Listed & compared by CourseAsk
- English · 0
Coursera
edX
Compared on these lists
Where this course ranks against the alternatives.