hi! this channel is aimed towards learning interesting domains of computer science. Here you can find videos on coding and algorithms, taught in a very simple way. Coding is considered difficult, but with right attitude and practice one can surely achieve great success. Happy Coding!!!

Connect on Linkedin : https://www.linkedin.com/in/pratiksen/

Binary Search Tree- Searching a binary search tree
13:40
Binary Search Tree- Searching a binary search tree
Binary Tree- Inorder traversal of a threaded binary tree
12:12
Binary Tree- Inorder traversal of a threaded binary tree
convert a binary tree to a threaded binary tree
23:37
convert a binary tree to a threaded binary tree
Binary tree- inorder traversal without recursion (using stack)
11:54
Binary tree- inorder traversal without recursion (using stack)
Binary Tree- Level order traversal in a binary tree
8:15
Binary Tree- Level order traversal in a binary tree
Binary Tree- level wise insertion in a binary tree
12:31
Binary Tree- level wise insertion in a binary tree
Tree Traversal#3- PostOrder traversal in a Binary Tree
13:26
Tree Traversal#3- PostOrder traversal in a Binary Tree
Tree Traversal #2- Preorder traversal in a Binary tree
13:42
Tree Traversal #2- Preorder traversal in a Binary tree
Tree Traversal #1- Inorder traversal in a Binary tree
10:06
Tree Traversal #1- Inorder traversal in a Binary tree
QUEUE- Implement QUEUE using Linked List
12:43
QUEUE- Implement QUEUE using Linked List
QUEUE data structure -Introduction
7:40
QUEUE data structure -Introduction
Infix to Postfix conversion
22:35
Infix to Postfix conversion
STACKS -implement stack using linked list
11:37
STACKS -implement stack using linked list
Stacks -introduction to stacks
7:05
Stacks -introduction to stacks
LINKED LIST -Delete duplicate without using a hash table
5:50
LINKED LIST -Delete duplicate without using a hash table
Understanding Time complexity of recursive functions
5:35
Understanding Time complexity of recursive functions
LINKED LIST - Delete duplicate entries using a hash table
12:30
LINKED LIST - Delete duplicate entries using a hash table
LINKED LIST- Insert a new node after a given node
4:01
LINKED LIST- Insert a new node after a given node
LINKED LIST -Append a node at the end of Linked List
7:33
LINKED LIST -Append a node at the end of Linked List
LINKED LIST- Push at the front at the front of Linked List
9:22
LINKED LIST- Push at the front at the front of Linked List
Depth First Traversal/ search(DFS) without recursion -using Stack of Iterators
24:36
Depth First Traversal/ search(DFS) without recursion -using Stack of Iterators
Detect cycle in Directed graph using stack of iterators
26:21
Detect cycle in Directed graph using stack of iterators
understanding Stack of Iterators and it's benefits
14:32
understanding Stack of Iterators and it's benefits
Graphs Depth First Traversal / Search (DFS)
30:29
Graphs Depth First Traversal / Search (DFS)
Graphs- Breadth First Search(BFS)
19:46
Graphs- Breadth First Search(BFS)
heap sort part 2
21:43
heap sort part 2
heap sort part 1- build the max heap
17:21
heap sort part 1- build the max heap
Analysing time complexity -part 1
5:31
Analysing time complexity -part 1
Know more about Python Object Oriented Programming
11:50
Know more about Python Object Oriented Programming
Custom Search Engine Part 5- Configuring Apache and testing
19:48
Custom Search Engine Part 5- Configuring Apache and testing