Programming Is Not Difficulty

  DATA STRUCTURES LAB(23CS52) 1A)Implement a singly linked list and perform insertion at the beginning and deletion of elements from the end, eliminating duplicates. 2A)Implement a double-linked list and perform insertion and deletion at the middle operations, and sort. 3A)Implement a Circular linked list and perform insert at the end and delete from the beginning, and search operations. 4A)Implement a double-ended queue (deque) with essential operations. B)Write a program to evaluate a postfix expression using a stack. 5A)Implement a Circular queue with essential operations. B)Implement a stack to perform comparison and check for symmetry. 6A)Use a stack to evaluate an infix expression and convert it to postfix. B)C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort 7A) Implement a BST using a Linked List and perform delete an element, and Tree Traversal techniques. 8A)Write a program to implement a simple cache using hashing. B)C Programs to impl...