When you enroll through our links, we may earn a small commission—at no extra cost to you. This helps keep our platform free and inspires us to add more value.
Advanced Data Structures-Part I-TREE ADT
Non Linear Abstract Data Type-Trees-Binary Tree-Binary Search Tree, Heap,AVL Tree,Red-Balck Tree, B-tree.
This Course Includes
udemy
4.3 (8 reviews )
6h 34m 
english
Online - Self Paced
professional certificate
Udemy
About Advanced Data Structures-Part I-TREE ADT
This course is intended to discuss in detail about Tree Abstract Data Type and its variants. Starting with basic introduction to General Trees, moves ahead to Binary trees, their implementation, Traversal algorithms and an application of Binary Tree. The variants of Binary Tree , starting from Binary Search Trees, Heaps, then moving into balanced BST - AVL trees, Red-Black trees, B-trees all are discussed in detail with their properties, operations and applications. The course discuss does not cover about pseudo code or about any specific programming language implementation. Practice Problems/quiz are given wherever required and the the solution to these problems is also discussed.
What You Will Learn?
- By learning this course, students will have a well understanding about the Tree Abstract Data type, its types and their applications .
- In depth knowledge about Binary Search Trees and their Operations .
- In depth Knowledge about AVL Trees ,Red-Black Trees and Heap .
- Getting an insight on different applications of all types of trees.