Toggle navigation
Scanftree.com
Academic Tutorials
Automata
Data Structure
OS
Graph Theory
Microprocessor
Cryptography
Compiler Design
Computer Graphics
IPv4
Parallel Algorithm
Programming
Tutorials
ASP.NET MVC
C
C++
JAVA
C#
Python
Programs
C
C++
JAVA
Python
Database Concept
DBMS
SQL
SQLite
TSQL-MSSQL
Preparation
Syllabus
Gate
Interview
Technical
HR/PI
Gk/Aptitude
Gk
Aptitude
MCQ
C
JAVA
Networking
Miscellaneous
Calculator
Health
Math
Developers
Css/Html Maker
Cheat Sheets
SEO Tools
Other
Math Formulas
IFSC Codes
: Scanftree
Data_Structure
insertion-in-doubly-linked-list
Data Structure
SEE THE INDEX
Introduction
Introduction
Linked List
Linked List
Operation and types
Singly Linked List
Creation of linked list
Insertion in linked list
Insertion in beginning
Insertion in location
Deletion in linked list
Deletion Of First Node
Deletion Of Last Node
Searching in linked list
Sorting in linked list
Doubly Linked List
Doubly linked list
Insertion in Doubly....
Insertion in beginning Dou..
Insertion in location doubly..
Insertion in last doubly..
Circular Linked List
Circular Linked List
Insertion in Circular Linked List
Insertion in beginning Circular
Insertion in Location Circular...
Insertion in last Circular link...
Deletion in Circular Linked List
Deletion at Beginning in Circu...
Deletion at Location in Circular...
Deletion at Last in Circular...
Stack
Stack
Static stack
Dynamic Stack
Application of stack
Infix to Postfix Conversion
Infix to Prefix Conversion
Postfix to Infix Conversion
Prefix to Infix Conversion
Prefix Infix Postfix converter
Queues
Queues
Static Queues
Dynamic Queues
Circular Queues
Double-ended Queue
Recursion
Recursion
Searching
Linear search
Binary Search
Sorting Algorithms
Bubble Sort
Insertion sort
Quick Sort
Heap sort
Merge sort
Counting sort
Radix sort
Bucket sort
complexity of sorting algorithms
Algorithms
Breadth First Search
Prim's Algorithm
Kruskal's Algorithm
Dijkstra's Algorithm
Bellman-ford Algorithm
Activity selection
Huffman Coding
Tree
B-Tree
Creation of B-Tree
Deletion in B-Tree
Interview Question
Insertion in doubly linked list
There are three situation for inserting element in list.
1.Insertion at the front of list.
2.Insertion in the middle of the list.
3.Insertion at the end of the list.
Insertion at the beginning of doubly linked list
Insertion in the location of doubly linked list
Insertion at last of doubly linked list
Aptitude / Reasoning / Interview
Physical education & sports