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.
Names verified with their owners' consent. We make no job promises.
NVIDIA · PhD, SFUHe 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.
Units 08 to 13 of the Data Structures & Algorithms diploma. Lessons are followed by practice assignments, with video walkthroughs of the solutions.
BT Homework 1 - 6 Easy Challenges
BT Homework 3 - 3 Medium Challenges
BT Homework 2 - 3 Medium to Hard Challenges
BST Homework 1 - 2 Easy Challenges
BST Homework 2 - 3 Medium Challenges
BST Homework 3 - 3 Medium Challenges
Heap Homework 1 - 5 Easy to Medium Challenges
Heap Homework 2 - 4 Medium to Hard Challenges
Homework Videos
AVL Homework 1 - 3 Medium to Hard Challenges
Homework Videos
A comparison between learning from scattered resources and learning from one integrated curriculum.
No interest and no hidden fees.
21 units in C++ · 200+ problems with explained solutions · interest-free installments up to 6 months
Try the teaching with the free lectures, then enroll in Advanced Data Structures for EGP 3,750 or in installments.
Completing the first course, or knowing complexity analysis, linked lists, stacks and queues.
Yes. You can enroll in the diploma's remaining courses one by one, or subscribe to the full diploma at any time.
Yes, over 3 months with no interest: EGP 1,675 down when you enroll, then 2 monthly payments of EGP 1,037.50.
Yes, they're fully recorded and you watch them whenever suits you.
Arabic, with technical terms in English so you can work with references and the job market.