Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms

edX MOOC / Non-credit USD 189

Enroll now →

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.

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

Skills you'll gain

algorithms data structures computer science sorting algorithms divide and conquer AVL trees 2-4 trees performance visualization iterative sorts

Related courses

Software Engineering

Software Testing and Automation

python 3.x Online Arabic

Python Development Professional Certification

Working with Objects in C++

Requirements Engineering: Secure Software Specifications

Memory Foundations in C++

Software Architecture for Big Data

Course details are provided by the platform and may change — always confirm on the provider's site. Links may be affiliate links.