Advanced Data Structures-Part I-TREE ADT

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. 

Non Linear Abstract Data Type-Trees-Binary Tree-Binary Search Tree, Heap,AVL Tree,Red-Balck Tree, B-tree.

Url: View Details

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

Rating: 4.8125

Level: Intermediate Level

Duration: 6.5 hours

Instructor: VENKATACHALAM MAHESWARI