Advanced Data Structures

Course 2 of 4 in the Data Structures & Algorithms diploma

The data structures behind efficient searching, indexing and hierarchical data: binary trees, binary search trees (BST), heaps, tries, AVL trees and hash tables.

Taught by Dr. Mostafa Saad Ibrahim
Senior Vision Engineer, NVIDIA
From the DSA diplomaPrerequisite: Course 1
57lectures
6units
08–13of the diploma units
3,750EGP, or installments up to 3 months
Course content
Illustration of the Data Structures & Algorithms diploma content

Watch the free lectures now

Data Structures & Algorithms Diploma · 5 free lectures

We'll only send you the link to the free lectures.
Illustration of the Data Structures & Algorithms diploma content
Now watching: the free lectures
Browse the curriculum
Learning outcomes

What you'll learn

  • Implement binary trees and their traversals.
  • Build binary search trees (BST) and balanced AVL trees.
  • Use heaps and tries to solve problems.
  • Understand hash tables and build them yourself.
Who will teach you?
Dr. Mostafa Saad Ibrahim speaking to CSkilled studentsNVIDIA · PhD, SFU
Dr. Mostafa Saad IbrahimSenior Vision Engineer, NVIDIA
Who will teach you?

Dr. Mostafa Saad Ibrahim

He has worked in AI for 15 years across research and engineering, and has published papers at CVPR and ECCV with more than 1,000 combined citations. He has taught programming since 2006 and runs a leading Arabic competitive programming channel on YouTube with more than 134 thousand subscribers.

Why he teaches this course himself

  • ICPC World Finalist, and coach and judge in programming competitions
  • Connects the material to what programmers need in real work
  • Head of the judging committee for programming contests in Egypt and Jordan (ECPC and ACPC)
+years teaching
+Courses & diplomas
+students
Full instructor profile
Detailed learning roadmap

Course curriculum: 6 units

Units 08 to 13 of the Data Structures & Algorithms diploma. Lessons are followed by practice assignments, with video walkthroughs of the solutions.

08Binary Tree14 lectures
Binary Tree 1
Binary Tree 2
Binary tree
Problem-Solving - Is Full - Is Perfect - Diameter
Diameter Code - Level Order Traversal
Unique Representation

BT Homework 1 - 6 Easy Challenges

BT Homework 1 - 6 Easy Challenges
BT Homework 1 - Solution p3 - target sum
BT Homework 1 - Solution p4 - left leaves
BT Homework 1 - Solution p5 - cousins

BT Homework 3 - 3 Medium Challenges

BT Homework 3 - 3 Medium Challenges
BT Homework 3 - Solution p3 - duplicate subtrees

BT Homework 2 - 3 Medium to Hard Challenges

BT Homework 2 - 3 Medium to Hard Challenges
BT Homework 2 - Solution p2 - completeness
09Binary Search Tree11 lectures
BST Intro
BST Successor - deletion
BST Deletion

BST Homework 1 - 2 Easy Challenges

BST Homework 1 - 2 Easy Challenges
BST Homework 1 - 2 Easy Challenges - p1 - search iterative
BST Homework 1 - 2 Easy Challenges - p2 - sorted to bst

BST Homework 2 - 3 Medium Challenges

BST Homework 2 - 3 Medium Challenges
BST Homework 2 - 3 Medium Challenges - p1 - is bst
BST Homework 2 - 3 Medium Challenges - p2 - kth

BST Homework 3 - 3 Medium Challenges

BST Homework 3 - 3 Medium Challenges
BST Homework 3 - 3 Medium Challenges - p1 - from preorder
10Heap7 lectures
Heap

Heap Homework 1 - 5 Easy to Medium Challenges

Heap Homework 1 - 5 Easy to Medium Challenges
Heap Homework 1 - 5 Easy to Medium Challenges - p3 less than
Heap Homework 1 - 5 Easy to Medium Challenges - p4 is heap
Heap Homework 1 - 5 Easy to Medium Challenges - p5 heap sort inplace

Heap Homework 2 - 4 Medium to Hard Challenges

Heap Homework 2 - 4 Medium to Hard Challenges
Heap Homework 2 - 4 Medium to Hard Challenges - p2 p3
11Trie12 lectures
Trie - UVA problem

Homework Videos

Trie Homework 1 - 5 Easy to Medium Challenges
Trie Homework 1 - Solution p1 - iterative
Trie Homework 1 - Solution p2 - minimal word
Trie Homework 1 - Solution p3 - suffix
Trie Homework 1 - Solution p4 - map
Trie Homework 1 - Solution p4 - path
Trie Homework 2 - 3 Medium Challenges
Trie Homework 2 - Solution p1 - list all
Trie Homework 2 - Solution p2 - autocomplete
Trie Homework 3 - 2 Hard Challenges
Trie Homework 3 - p2 prefix suffix
12AVL Tree4 lectures
AVL

AVL Homework 1 - 3 Medium to Hard Challenges

AVL Homework 1 - 3 Medium to Hard Challenges
AVL Homework 1 - 3 Medium to Hard Challenges - p1 p2
AVL Homework 1 - 3 Medium to Hard Challenges - p3 inversions
13Hash Tables9 lectures
HashTable 1
HashTable 2

Homework Videos

Hash Homework 1 - 3 Medium Challenges
Hash Homework 1 - Solution p1 - hash string
Hash Homework 1 - Solution p2 - hash object
Hash Homework 1 - Solution p3 - rehashing
Hash Homework 2 - 5 Medium Challenges
Hash Homework 2 - Solution p1 - linked list
Hash Homework 2 - Solution p2 - quadratic

Why CSkilled instead of scattered resources?

A comparison between learning from scattered resources and learning from one integrated curriculum.

Scattered resources (YouTube / generic courses / bootcamps)

  • Depth and curriculum: Scattered content with no clear order, so you get lost between levels.
  • Practice: Few problems, often without explained solutions, and small, incomplete projects.
  • Instructor and language: Uneven quality of explanation, and much of it is in English only.
  • Support and cost: No guidance, and dollar-priced subscriptions or expensive bootcamps.

What do you get at CSkilled Academy?

  • Depth and curriculum: 70 lectures and 90 hours in two versions, Python and C++, explaining the idea before using any ready-made tool.
  • Practice and projects: Graded problems with explained solutions, and hands-on projects that bring what you learned together into complete work.
  • Instructor and language: Taught in Arabic with English terminology, with six Diplomas taught by Dr. Mostafa Saad, who has taught programming for 20 years and is a Senior Computer Vision Engineer at NVIDIA with a PhD in Computer Vision.
  • Support and payment: A support team that answers your questions on WhatsApp, and interest-free installments for up to 6 months.
What our students say

Real experiences from students who completed the journey

Hundreds of verified reviews
Advanced Data Structures
57 lectures · EGP 3,750
Watch the free lecturesEnroll in the course
Price and payment

Enroll in the course, or take the full diploma

No interest and no hidden fees.

Course 2 of 4

Advanced Data Structures

57 lectures6 units
Pay in full3,750EGP
Or installments up to 3 months1,675 down, then 2 × 1,037.50 EGP
Outside Egypt$75 in USD
Full diploma

Data Structures & Algorithms Diploma

21 units in C++ · 200+ problems with explained solutions · interest-free installments up to 6 months

Take the diploma in installments over up to 6 months
Judge the teaching for yourself

Start with the free lectures today

Try the teaching with the free lectures, then enroll in Advanced Data Structures for EGP 3,750 or in installments.

No payment detailsInterest-free installments up to 3 monthsTaught in Arabic with the English terms
FAQ

Questions before you enroll

What are the prerequisites for this course?

Completing the first course, or knowing complexity analysis, linked lists, stacks and queues.

Can I complete the full diploma later?

Yes. You can enroll in the diploma's remaining courses one by one, or subscribe to the full diploma at any time.

Can I pay in installments?

Yes, over 3 months with no interest: EGP 1,675 down when you enroll, then 2 monthly payments of EGP 1,037.50.

Are the lectures recorded?

Yes, they're fully recorded and you watch them whenever suits you.

What language is the teaching in?

Arabic, with technical terms in English so you can work with references and the job market.

shieldOur principle: no unrealistic job promises, just solid engineering training.
Have a question?