1. Tree - Basic Concepts, Rooted Tree, M-ary Tree

In this 50 mins Video Lesson

Tree, Terminal / Internal Node, Rooted Tree, Level of a node, Height / Depth, Father / Son, Brothers, Ancestor / Descendant, M-ary Tree, Complete m-ary tree, Example, and other topics.

Tree, Terminal / Internal Node, Rooted Tree, Level of a node, Height / Depth, Father / Son, Brothers, Ancestor / Descendant, M-ary Tree, Complete m-ary tree, Example, and other topics.

2. Binary Tree, Traversal, Binary Search Tree

In this 54 mins Video Lesson

Binary Tree Traversal, Pre / Post / In - Order Traversal, Expression Tree, General tree to Binary tree, Binary Search Tree, and other topics.

Binary Tree Traversal, Pre / Post / In - Order Traversal, Expression Tree, General tree to Binary tree, Binary Search Tree, and other topics.

3. Prefix Codes, Weighted Tree, Huffman Coding

In this 37 mins Video Lesson

Prefix Codes, Optimal Prefix Code, Weighted tree, Optimal Weighted Tree, Huffman Coding Algorithm for Optimal tree, and other topics.

Prefix Codes, Optimal Prefix Code, Weighted tree, Optimal Weighted Tree, Huffman Coding Algorithm for Optimal tree, and other topics.

4. Spanning Tree, Kruskal’s Algorithm, Prim’s Algorithm

In this 54 mins Video Lesson

Spanning tree, Minimum Spanning tree, Kruskal's Algo for MST, Prim's Algo for MST, and other topics.

Spanning tree, Minimum Spanning tree, Kruskal's Algo for MST, Prim's Algo for MST, and other topics.

5. Fundamental Circuit, Fundamental Cutset, Transport Network

In this 42 mins Video Lesson

Fundamental Circuit, Fundamental Cut Set, Transport Networks, Cut in a Transport Network, Max Flow - Min Cut Theorem, Labelling Algo for Min Cut, and other topics.

Fundamental Circuit, Fundamental Cut Set, Transport Networks, Cut in a Transport Network, Max Flow - Min Cut Theorem, Labelling Algo for Min Cut, and other topics.

6. A Rendering of Labelling Algorithm

In this 29 mins Video Lesson

Labelling Algorithm: Example, and other topics.

Labelling Algorithm: Example, and other topics.

Trees
(3.24 Mb)

Trees, rooted trees, path length in rooted trees, prefix codes, binary search trees, spanning trees and cut set, minimal spanning trees, Kruskal’s and Prim’s algorithms for minimal spanning tree, The Max flow –Min cut theorem (transport network).