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.
31TAKE THIS COURSE