I am an Information Technology engineer possessing B.Tech in I.T and Gate qualified M.E in Software Engineering. I have 5 years of experienc

Parul Oberoi

This course will help the learner to thoroughly 
understand the concepts and working of various Data Structures like arrays, linked lists, stacks, queues, trees and graphs and sorting Algorithms. This course carries lot of weightage in GATE exam.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Introduction to Data Structures with Algorithms : GATE

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson talks about the two traversals Preorder and Inorder of a tree data Structure, includes an example for the same.

Traversal Operation in a Tree Data Structure (Preorder, Inorder)

This lesson is about post order traversal of a Tree Data Structure with example and one practice question

Traversal operation in tree data Structure (Postorder)

Explains about creating binary tree from traversals

Creation of Binary Tree from Traversals

Introductory session of trees
Terms used to represent tree
Binary tree and its types 
Implementation using arrays and linked lists

Introduction to Tree data Structure

This lesson contains the implementation of binary tree using arrays and linkes lists
Properties of binary trees
Expression trees

Implementation of Binary Trees, Properties of Binary Tree, Expression Trees

Gives Introduction of binary search tree, search operation and its algorithm

Introduction to Binary search tree(BST) and Search operation

Covers traversal and insertion operations in BST with algorithm

Traversal and Insertion operations in Binary Search Tree

-Covers deletion operation in BST
-Deleting leaf node or node with one child or node with two children
-Covers algorithm also

Deletion operation in BST

-Covers Introduction of heap tree
-what is max heap and min heap
-representation of heap tree in memory
-insertion opeartion

Intoduction of Heap trees and insertion operation

Covers insertion algortihm
Deletion operation
Deletion algorithm

Heap tree: insertion operation algorithm, Deletion operation and algorithm

Heap sort

Introduction to AVL trees
Introduction to insertion operation

AVL trees

AVL insertion: single rotation
LL rotation with example
RR rotation with example

AVL insertion: rotations

AVL tree: double rotation
LR rotation with example 
RL rotation with example

AVL insertion: double rotation

Introduction to Arrays
Traversal operation with algorithm and example

Arrays

Array operation: search
Linear search example and algorithm 
Binary search intro

Arrays operation: searching

Array: Binary search operation 
Example 2, algorithm, complexity

Array: Binary Search

Array operations 
Insertion with example and algorithm 
Deletion with example and algorithm

Array operations : Insertion and Deletion

Linked lists: intro
Advantages over arrays 
Traversal operation, example and algorithm

Linked lists

Linked Lists: Search Operation on
Sorted and unsorted linked list
Exmaple and algorithm 
Complexity

Linked lists :Search Operation

Linked Lists: Insertion operation 
Insertion at first: example and algorithm 
Insertion at last: example and algorithm 
Insertion in middle: example and algorithm

Linked Lists: Insertion Operation

Linked lists: Deletion operation 
Deletion at first: example and algorithm 
Deletion at last:example and algorithm 
Deletion in middle: example and algorithm 
Task to delete a node with given information 
Complexity of all the operations of linked lists

Linked Lists: Deletion operation

Covers types of linked list
Header linked lists and its use
Circular linked list, its use and operations and algorithm

Types of linked lists

Doubly linked lists: Introduction 
Operations: Traversal, Searching
Insertion with example and algorithm 
Deletion with example and algorithm

Doubly Linked list

Stacks: Introduction 
Implementating stacks using arrays
Push and Pop operation
Example and algorithm

Stacks

Stacks implementation using Linked lists
Push and Pop operation 
Example and algorithm

Stacks contd.

Applications of stacks
Evaluating postfix expression using stacks

Stacks applications , Evaluating postfix expression using stacks

Stack application
Infix expression to postfix expression conversion 
Examples and algorithm

Stacks applications, infix to postfix conversion

Stacks applications 
Reversal of string : example and algorithm 
Delimiter Matching: example and rules

Stacks applications : Reverse a string , Delimiter matching

Stack applications:
Function calls
Decimal to binary conversion

Stacks applications: function call and decimal to binary conversion

Stacks application: 
Quicksort : example and complexity

Stack applications: Quicksort

Introduction to Queues

Array representation of QUEUES 
Enqueue and dequeue operation, example and Algorithm

Array representation of queues and its operations with example and algorithm

Linked list representation of queues 
Enqueue and Dequeue operations with examples and algorithm

Linked list representation of Queues

Deques(Double ended queues)
Priority Queues

Deques( Double ended queues) , Priority queue

Pursuing Bachelors in Computer Engineering. Have been teaching since the early age of 15. Published author in IEEE.

Viral Tagdiwala

This course involves the Basics of Pointers in C programming language.

Introduction to Pointers in C

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses what are data structures, why data structures are so important and the diffferent types of data structures. The course also takes you through arrays in detail.

Introduction to Data Structures: GATE (CS and IT)

BTech IIIT Bhubaneswar, Qualified JEE Mains 2014,2015, Indian Engineering Olympiad AIR 37, GATE Qualified in 2018 (98.54 Percentile)

Subham Mishra

In this course storage class specifiers with standard output questions asked in campus interview and competitive exams will be covered.

(Hindi) Programming in C for GATE: Storage Class Specifiers

🌟YouTube👉Make It easy #padhai
⭐Currently Educator at Knowledge Gate

Vinay Mishra

In this course, the educator is discussing 
the concept of Data Structures & Algorithm where I'll tell you how to analyze and solve questions of Gate exams using the logic & we'll also learn the tricks & skills to solve any questions in quick time.Hope you'll like it!

Lessons

35 lessons • 7h 14m

Invalid Date

NaN

Traversal Operation in a Tree Data Structure (Preorder, Inorder)

Invalid Date

NaN

Traversal operation in tree data Structure (Postorder)

Invalid Date

NaN

Creation of Binary Tree from Traversals

Invalid Date

NaN

Introduction to Tree data Structure

Invalid Date

NaN

Implementation of Binary Trees, Properties of Binary Tree, Expression Trees

Invalid Date

NaN

Introduction to Binary search tree(BST) and Search operation

Invalid Date

NaN

Traversal and Insertion operations in Binary Search Tree

Invalid Date

NaN

Deletion operation in BST

Invalid Date

NaN

Intoduction of Heap trees and insertion operation

Invalid Date

NaN

Heap tree: insertion operation algorithm, Deletion operation and algorithm

+ See all lessons