02:57

Selection Sort

02:15

Binary Search

02:14

Search Techniques - Linear Search

01:51

Applications of Binary Trees

02:53

Threaded Binary Tree

02:58

Binary Search Tree

01:16

Other Tree Operations

02:51

Binary Tree Traversal

02:30

Insertion of a Node in Binary Tree

02:17

Realization of a Binary Tree

03:21

Binary Tree Abstract Data Type

02:26

Binary Tree

01:50

Types of Trees

03:07

Linked Queue

02:36

Linked Stack

03:00

Representation of Sparse Matrix Using Linked List

02:38

Circular Linked List

02:07

Doubly linked list

01:54

Linked List Variants

02:51

Linked List

01:44

Applications of Queues

02:39

Priority Queue

02:22

Dequeue

02:36

Multi-queues

04:04

Circular Queue

02:52

Realization of Queues Using Arrays

02:32

Queue as Abstract Data Type

03:32

Queues: Concept of Queues

03:01

Iteration versus Recursion

01:41

Recursive Functions

02:55

Common variants of recursion

02:39

Use of Stack in Recursion

02:37

Recurrence

02:02

Recursion

01:12

Reversing a String with a Stack

03:25

Processing of Function Calls

01:50

Polish notation and expression conversion

02:53

Expression Evaluation and Conversion

02:38

Applications of Stack

05:37

Multiple Stacks

03:16

Representation of Stacks Using Sequential Organization (Arrays)

05:21

Stacks

02:15

Concept of Stacks and Queues

03:19

Analysis of Algorithms

02:42

Implementation of data structures

02:15

Data Structures and Algorithms

02:55

Relationship among data

02:10

Pseudocode

02:08

Introduction to Algorithms

03:10

Types of Data Structures

01:57

Basic data Structure: Introduction to Data Structures

02:33

Introduction to the STL

01:49

Class Templates and Inheritance

01:44

Defining Objects of the Class Template

02:01

Class Templates – Introduction

02:16

Overloading with Function Templates

01:35

Function Templates with Multiple Type

01:56

Templates: Function Templates–Introduction

01:40

Re-throwing an Exception

01:45

Extracting Data from the Exception Class