Binomial Coefficient using Dynamic Programming

Strassen's Matrix Multiplication

Trees - Video 14 - Constructing Binary Tree when Postorder and Inorder Traversals are given.

Trees - Video 13 - Constructing a Binary Tree when Preorder and Inorder Traversals are given

Breadth First Search [BFS] operation, iterative and recursive algorithms, C Code and Time Complexity

Merge Sort with Operation, Algorithm, C Code, Merge Call Tree and Time Complexity

Trees - Video 11 - Iterative Postorder Traversal

Trees - Video 10 - Iterative Inorder Traversal

Trees - Video 9 - Iterative Preorder Traversal

Trees - Video 8 - Recursive Postorder Traversal

Trees - Video 7 - Recursive Inorder Traversal

Trees - Video 6 - Recursive Preorder Traversal

Trees - Video 1 - Introduction to Trees

Trees - Video 12 - Insertion and Creation in a Binary Search Tree

Trees - Video 2 - Memory Representation of Binary Tree

Queue - Video 1 - Linear Queue implementation using Arrays

Trees - Video 5 - Postorder Traversal of a Binary Tree

Trees - Video 4 - Inorder Traversal of a Binary Tree

Trees - Video 3 - Preorder Traversal of a Binary Tree

Stack - Video 10 - Sum of Natural Numbers using Recursion

Stack - Video 5 - Introduction to Recursion

Stack - Video 9 - Tower of Hanoi using Recursion

Stack - Video 8 - GCD of Two Numbers using Recursion

Stack - Video 7 - Fibonacci Number using Recursion

Stack - Video 6 - Factorial using Recursion