Unit III: Linked Lists, Stacks, and Queues | BCA 3rd Semester Data Structure and Algorithms (DSA) Notes Pdf

A linked list is a sequence of data structures, which are connected together via links. A linked list is a sequence of links that contain items. Each link contains a connection to another link. The Linked list is the second most-used data structure after array.

In this “Linked Lists, Stacks, and Queues – Data Structure and Algorithms” you will learn about the following topics:

1. Linked List
2. Types of Linked List
3. Singly Linked List or One Way Chain
4. Operations on Singly Linked List
5. Insertion In Singly Linked List At Beginning, Insertion In Singly Linked List At The End, Insertion In Singly Linked List After Specified Node, Insertion In Singly Linked List After Specified Node, Deletion In Singly Linked List At Beginning, Deletion In Singly Linked List At The End, Deletion In Singly Linked List After The Specified Node, Traversing In Singly Linked List, Searching In Singly Linked List
6. Example of Singly Linked List
7. Doubly Linked List
8. Operation in Doubly Linked List
9. Insertion In Doubly Linked List At Beginning, Insertion In Doubly Linked List At The End, Insertion In Doubly Linked List After Specified Node, Deletion At Beginning, Deletion In Doubly Linked List At The End, Deletion In Doubly Linked List After The Specified Node, Searching For A Specific Node In Doubly Linked List, Traversing In Doubly Linked List
10. Example of Doubly Linked List
11. Circular Singly Linked List
12. Operations on Circular Singly Linked List
13. Insertion Into Circular Singly Linked List At Beginning, Insertion Into Circular Singly Linked List At The End, Deletion in Circular Singly Linked List at the End, Searching In Circular Singly Linked List, Traversing In Circular Singly Linked List
14. Example Circular Singly Linked List
15. Circular Doubly Linked List
16. Operations on Circular Doubly Linked List
17. Insertion in Circular Doubly Linked List at Beginning, Insertion In Circular Doubly Linked List At End, Deletion in Circular Doubly Linked List at Beginning, Deletion in Circular Doubly Linked List at End
18. Example Circular Doubly Linked List
19. Stack
20. Working of Stack
21. Standard Stack Operations
22. PUSH Operation, POP Operation, Peek Operation
23. Example of Stack
24. Expression Parsing
25. Infix Notation, Prefix Notation, Postfix Notation
26. Parsing Expressions
27. Precedence, Associativity
28. Queue
29. Operations on Queue
30. Types of Queue
31. Linear Queue
32. Enqueue Operation, Dequeue Operation
33. Example of Linear Queue
34. Circular Queue
35. Operations on Circular Queue
36. Enqueue Operation, Dequeue Operation
37. Example of Circular Queue

==== Point to Note ====

If you like to contribute, you can mail us BCA Notes, BCA Question Collections, BCA Related Information, and Latest Technology Information at [email protected].

See your article appearing on BCA Notes (Pokhara University) main page with your designation and help other BCA Students to excel.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

BCA 3rd Semester Data Structure and Algorithms (DSA) Notes Pdf:

• Unit I: Introduction of Data Structure and Algorithms (DSA)
• Unit II: Algorithm Analysis
• Unit IV: Trees Data Structure
• Unit V: Hashing
• Unit VI: Priority Queues
• Unit VII: Sorting Techniques or Algorithms
• Unit VIII: Graphs Algorithms
• Unit IX: Algorithm Design Techniques