Insertion Algorithm in Doubly Circular Linked list
Traverse and search of Doubly Circular Linked List
Doubly Circular Linked List - Python Implementation
Why we need Tree Data structure?
Tree Terminology - Part 1
Tree Terminology - Part 2
Introduction to Binary tree
Types of Binary Tree
Binary Tree representation
Creating Binary Tree using Linked List
Pre-Order traversal using Linked List
In-Order Traversal using Linked List
Post-Order Traversal using Linked List
Binary Tree Traversal - Python Implementation
Insertion in Binary Tree using Linked List
Search in Binary Tree using Linked List
Deletion in Binary Tree using Linked List
Delete Binary Tree using Linked List
Creation of Binary Tree using Arrays
Insertion Algorithm in Binary Tree using Array
In-Order Traversal using Array
Pre-Order traversal using Array
Post-Order Traversal using Array
Deletion in Binary tree using array
Delete Binary tree using Array
Binary Search Tree - Introduction 1
Binary Search Tree - Introduction 2
Creation of Binary Search Tree
Traversal of Binary Search Tree
Insertion in Binary Search Tree
Insertion algorithm in Binary search tree
Deletion of Binary search Tree
Delete Binary search Tree
Binary Search Tree - Python Implementation
AVL Tree - Introduction
What is AVL Tree?
Creation and search of AVL Tree
Traversal of AVL Tree
Insertion in AVL Tree
AVL Tree - Insertion, Height, Balance creation - Python Implementation
Left-Left Violation in AVL tree
Right-Right Violation in AVL Tree
Left-Right Violation in AVL Tree
Right-Left Violation in AVL Tree
AVL Tree - Violation and rotation - Python Implementation
Deletion in AVL Tree
AVL Tree - Removal and testing - Python Implementation
Basic computer programming
Basic Mathematics knowledge
The course Data structures and Algorithm using Python covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming.
You will learn a lot of theory: how to sort data and how it helps for searching. How to break a large problem into pieces and solve them recursively and it makes sense to proceed greedily.
Implemented all the concepts using Python 3 using Pycharm IDE and explained the time complexity and difficulty of the data structures.
This course contains of these below mentioned topic:
Algorithm run time analysis
Binary Search Tree
Who this course is for:
Beginner who have little programming experience , willing to learn and pursue data science career.
Office productivity, Data analyst and stock trader
3.7 Instructor Rating
I am a software engineer turned into stock trader. Author of 12+ courses with more than 50K students enrolled. I am very passionate on teaching office productivity, software programming and stock market analysis.
Worked with teaching several corporate on Office productivity and Programming. Running an teaching centre of my own.
Trade in stock market whenever I could see opportunity.