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.

4.81 (8 reviews)
Udemy
platform
English
language
Engineering
category
Advanced Data Structures-Part I-TREE ADT
65
students
6.5 hours
content
Sep 2020
last update
$64.99
regular price

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

Why take this course?

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. 

Content

Introduction

Introduction
Course Curriculum

Tree ADT

Tree - Introduction
Tree-Terminology
Practice Activity - 1

Binary Tree

Binary Tree- Introduction
Binary Tree- Implementation
Binary Tree Traversal
Binary Tree application-Expression Tree
Practice Activity - 2
Practice Activity - 3

Binary Search Tree

Binary Search Tree-Introduction
Binary Search Tree-Operations
Binary Search Tree-Deletion
Binary Search Tree-Applications
Quiz 1

Heap and Heapsort

Heap-Construction
HeapSort
Quiz2

AVL Tree

AVL Tree-Introduction
AVL Tree-Insertion
AVL Tree-Deletion
Practice Activity - 4

Red-Black Tree

Red-Black Tree-Introduction
Red-Black Tree-Insertion
Red-Black Tree-Deletion
Red-Black Tree - Detailed Example
AVL, Red-Black -summary, applications

B-Tree

B-Tree - Introduction
B-Tree - Searching,Insertion
B-Tree - Deletion
B-Tree-Summary -Applications
Practice Activity - 5
Quiz3

Screenshots

Advanced Data Structures-Part I-TREE ADT - Screenshot_01Advanced Data Structures-Part I-TREE ADT - Screenshot_02Advanced Data Structures-Part I-TREE ADT - Screenshot_03Advanced Data Structures-Part I-TREE ADT - Screenshot_04

Reviews

Murugan
September 22, 2020
NICE INTRODUCTION TO TREES EXAMPLES ON BST, AVL AND RED BLACK TREES ARE WELL EXPLANATORY QUIZ AND ASSIGNMENTS ARE MODERATELY TOUGH.
MuthuKumar
September 14, 2020
Thank you madam ,the way you explain the topic is very good. I am able to understand the concept clearly. You explained Advanced topics like AVL Tree, Red-Black Tree and B-Tree are excellent .

Charts

Price

Advanced Data Structures-Part I-TREE ADT - Price chart

Rating

Advanced Data Structures-Part I-TREE ADT - Ratings chart

Enrollment distribution

Advanced Data Structures-Part I-TREE ADT - Distribution chart

Related Topics

2984914
udemy ID
4/10/2020
course created date
9/15/2020
course indexed date
Bot
course submited by