# Definition of Linked List, conception of Node, and understanding basic terminologies

A free video tutorial from Shibaji Paul
Programming Instructor with 16+ years of experience
4.5 instructor rating â€¢ 7 courses â€¢ 27,548 students

## Lecture description

Understanding the definition of Linked List, conception of Node in a Linked List, how the link works. The external pointers for accessing linked list.

Fundamental Data Structures & Algorithms using C language.

Learn Data Structures and algorithms for Stack, Queue, Linked List, Binary Search Tree and Heap ( using C Programming ).

15:39:49 of on-demand video â€¢ Updated April 2020

• Recursion, Stack, Polish Notations, infix to postfix, FIFO Queue, Circular Queue, Double Ended Queue, Linked List - Linear, double and Circular - all operations, Stack and Queue using Linked List
• What is stack, algorithms for Push and Pop operation. Implementation of Stack data structure using C.
• Using Stack - checking parenthesis in an expression
• Using Stack - Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression
• What is a FIFO Queue, understanding Queue operations - Insert and delete, implementing FIFO Queue
• Limitations of FIFO queue, concept of Circular Queue - Implementation of Circular queue.
• Concept of Double ended queue, logic development and implementation of double ended queue.
• Concept of Linked List - definition, why we need linked list.
• Singly Linked List - developing algorithms for various methods and then implementing them using C programming
• Doubly Linked List - developing algorithm of various methods and then implementing them using C programming
• Circular Linked List - developing algorithm of various methods and then implementing them using C programming
• How to estimate time complexity of any algorithm. Big Oh, Big Omega and Big Theta notations.
• Recursion, concept of Tail recursion, Recursion Vs Iteration.
• Binary Tree, definition, traversal (in-order, pre-order and post-order), binary search tree, implementation.
• Heap - concept, definition, almost complete binary tree, insertion into heap, heap adjust, deletion, heapify and heap sort.