Posted in All Posts, Semester 3

Sem 3 – DS Unit 4 Programs

DS – Data Structures

Unit 4 – Queue, Tree and Graph

1. Write a program to implement Simple Queue operations using Linked List.
• ENQUEUE
• DEQUEUE
• Traversal (display)
Download | View Code

2. Write a program to implement Circular Queue operations Using Linked List.
• ENQUEUE
• DEQUEUE
• Traversal (display)
Download | View Code

3. Write a program to implement following operations on Binary Search Tree using Linked List.
• Creation
• Insertion
• Traversal( In-order, Pre-order, Post-order)
Download | View Code

4. Write a program to implement DFS and BFS traversal of a graph.
[Will be available soon]

Download All

I hope that you found this article to be helpful.
Please share your thoughts in the Comments Section.

If you liked this article, then please like our Facebook page.

Suggested Reading

2 thoughts on “Sem 3 – DS Unit 4 Programs

Comment your thoughts

This site uses Akismet to reduce spam. Learn how your comment data is processed.