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.

Ratings 4.94 / 5.00
Advanced Data Structures-Part I-TREE ADT

Description

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 applicatons

Who Should Attend!

  • Students interested in learning in detail about Non-Linear Abstract Data Type

TAKE THIS COURSE

Tags

  • Binary Options

Subscribers

14

Lectures

31

TAKE THIS COURSE



Related Courses