Главная
Study mode:
on
1
- TREE TERMINOLOGY
2
- BINARY TREES AND TYPES OF BINARY TREE
3
- BINARY TREE REPRESENTATION
4
- BINARY TREE TRAVERSALS WITH EXAMPLE
5
- CONSTRUCTION OF EXPRESSION TREE
6
- BINARY TREE CONSTRUCTION WITH INORDER AND PREORDER TRAVERSAL
7
- BINARY TREE CONSTRUCTION WITH INORDER AND POSTORDER TRAVERSAL
8
- BINARY SEARCH TREE AND ITS OPERATIONS
9
- CONSTRUCTION AND INSERTION OF AN ELEMENT INTO BINARY SEARCH TREE
10
- DELETION OF AN ELEMENT FROM BINARY SEARCH TREE
11
- SEARCHING AN ELEMENT IN BINARY SEARCH TREE
12
- FINDING MINIMUM ELEMENT FROM BINARY SEARCH TREE
13
- FINDING MAXIMUM ELEMENT FROM BINARY SEARCH TREE
14
- AVL TREE
15
- ROTATIONS IN AVL TREE
16
- AVL TREE CONSTRUCTION AND INSERTION OF AN ELEMENT
17
- GRAPH TERMINOLOGY AND TYPES OF GRAPHS
18
- REPRESENTATION OF GRAPHS
19
- DEPTH FIRST SEARCH - GRAPH TRAVERSALS
20
- BREADTH FIRST SEARCH - GRAPH TRAVERSALS
21
- INTRODUCTION TO SPANNING TREE AND MINIMUM COST SPANNING TREE
22
- PRIM'S ALGORITHM - FINDING MINIMUM COST SPANNING TREE
23
- EXAMPLES TO FIND MINIMUM COST SPANNING TREE - PRIM'S ALGORITHM
24
- KRUSKAL'S ALGORITHM - FINDING MINIMUM COST SPANNING TREE
Description:
Dive deep into non-linear data structures with this comprehensive 6-hour video tutorial. Master trees and graphs, covering essential concepts like binary trees, tree traversals, expression trees, binary search trees, AVL trees, and graph algorithms. Learn to implement various operations, including insertion, deletion, and searching in binary search trees. Explore graph representations, traversal techniques like depth-first and breadth-first search, and understand spanning trees. Gain practical knowledge of minimum cost spanning tree algorithms such as Prim's and Kruskal's. Perfect for those looking to strengthen their understanding of advanced data structures and algorithms.

Non Linear Data Structures - Complete Non Linear Data Structures - Data Structures Part-2

Sundeep Saradhi Kanthety
Add to list
0:00 / 0:00