The Advanced Data Structures course focuses on the design, analysis, and implementation of efficient data organization techniques used to solve complex computational problems. Building upon fundamental concepts such as arrays, linked lists, stacks, and queues, this course introduces advanced structures like trees, graphs, heaps, hash tables, and self-balancing trees.Apply Data Structures to Real-World Problems
Course Details
Explore the comprehensive course modules
Introduction to Binary Tree Properties of Binary Tree Types of Binary Tree Efficient searching algorithms-I Efficient searching algorithms-II Efficient sorting algorithms-I Efficient sorting algorithms-II and use cases of Binary Tree
Definition and Structure of a BST BST Properties Real-world Applications of BST Searching in BST Insertion in BST Deletion in BST Traversal in BST
Definition and Structure of a Red Black Tree Rotations in RBT Searching in RBT Insertion in RBT Deletion in RBT Real-world Applications of RBT Traversal in RBT
Introduction and AVL vs Red-Black Tree Rotations: LL, RR, LR, RL Insertion with rebalancing Deletion with rebalancing Search operation Real-world use cases Evaluation 2
Introduction to multiway trees (B-Tree, B+ Tree, etc.) Structure: nodes with multiple keys and children B-Tree properties Insertion in B-Trees Deletion in B-Tree Search in B-Tree Difference between B-Tree and B+ Tree with use cases
Introduction and basic structure Insertion operations Search operations Deletion in Trie Applications, Trie vs HashMap Compressed Trie (Radix Tree), Ternary Search Trie Evaluation 3
Learn from leading experts in stem cell research
Dr.Sarneet Kaur