Scribd
Upload
2 views2 pages

Guidelines DS Python GE4a

The document outlines a series of programming tasks to implement various data structures as Abstract Data Types (ADTs). These include singly linked lists, doubly linked lists, circular linked lists, stacks, queues, and binary search trees, each with specified operations such as insertion, deletion, and searching. Additionally, it includes tasks for evaluating expressions using stacks and implementing AVL trees.

Uploaded by

balabhadrabhoi07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Guidelines DS Python GE4a

The document outlines a series of programming tasks to implement various data structures as Abstract Data Types (ADTs). These include singly linked lists, doubly linked lists, circular linked lists, stacks, queues, and binary search trees, each with specified operations such as insertion, deletion, and searching. Additionally, it includes tasks for evaluating expressions using stacks and implementing AVL trees.

Uploaded by

balabhadrabhoi07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

-

- -

-
- -
-

- -

- -

- - -

1.

2.

3.

(i)

Practicals List

1. Write a program to implement singly linked list as an ADT that supports the following opera-
tions:
i. Insert an element x at the beginning of the singly linked list
ii. Insert an element x at ith position in the singly linked list
iii. Remove an element from the beginning of the doubly linked list
iv. Remove an element from ith position in the singly linked list.
vi. Search for an element x in the singly linked list and return its pointer

2. Write a program to implement doubly linked list as an ADT that supports the following op-
erations:
i. Insert an element x at the beginning of the doubly linked list
ii. Insert an element x at the end of the doubly linked list
iii. Remove an element from the beginning of the doubly linked list
iv. Remove an element from the end of the doubly linked list

3. Write a program to implement circular linked list as an ADT which supports the following
operations:
i. Insert an element x in the list
ii. Remove an element from the list
iii. Search for an element x in the list and return its pointer

4. Implement Stack as an ADT and use it to evaluate a prefix/postfix expression.


5. Implement Queue as an ADT.
6. Write a program to implement Binary Search Tree as an ADT which supports the following
operations:
i. Insert an element x
ii. Delete an element x
iii. Search for an element x in the BST
iv. Display the elements of the BST in preorder, inorder, and postorder traversal

7. Write a program to implement insert and search operation in AVL trees.

You might also like