Module – 03

Question Bank

1. Implement addition and deletion of a Node on a Doubly Linked List (DLL)

with required C-statements.
2. For the given Sparse matrix , Write the diagrammatic linked list
representation.
3 0 0 0
A = 5 0 0 6
0 0 0 0
4 0 0 8
0 0 9 0
3. Write a functions to perform following operations on double linked list
i. Insert a node at rear end of list
ii. Deletion a node at rear of the list
4. Define a Tree. With suitable example explain
i. Binary Tree
ii. Skewed binary tree
iii. Complete binary tree
iv. Full binary tree.
5. Write the routines to traverse the given tree using
i. Pre-order traversal
ii. Post-order traversal
6. Write a C function for the concatenation of two doubly linked lists.
7. Write a C function to insert a node at front and delete a node from the
rear end in a circular linked list.
8. Describe the doubly linked lists with advantages and disadvantages.
Write a C function to delete a node from a circular doubly linked list with
header node.
9. Explain threaded binary trees and their representations with a neat
diagram. Also, develop a C function to do the inorder traversal of a
threaded binary tree
10. A binary tree has 9 nodes. The inorder and preorder traversals yield the
following sequences of nodes:
i. Inorder: E A C K F H D B G
Preorder: F A E K C D H G B
ii. Preorder: A B C E I F J D G H K L
Inorder: E J C F J B G D K H L A
Draw the binary tree. Also perform the post order traversal of the
obtained tree.
11. What is advantage of the threaded binary tree over binary tree? Explain
the construction of the threaded binary tree for 10,20,30,40 and 50.
12. Draw a binary tree for the following expression : ((6+(3-2)*5)^2+3.
Traverse the above generated tree using Pre-order and Post order and
also write their respective functions.
13. For the given Sparse matrix , Write the diagrammatic linked list
representation.
0 1 2
A= 3 0 0
0 0 0
14. For the given Sparse matrix , Write the diagrammatic linked list
representation.
0 0 4 0 0
A= 6 5 0 0 0
0 3 0 1 0
0 0 0 0 2
15. Define threaded binary tree. List its advantages and disadvantages.
Draw the one way threading and two way threading of the following
binary tree.
A
B C
D E F G
H

16. Represent the below given tree in given figure, using

i. Linked list representation
ii. Left child right sibling representation.
 A
B C D
E F G H
I
J K
17. For the given Sparse matrix , Write the diagrammatic linked list
representation.
0 0 3 0 4
A= 0 0 5 7 0
0 0 0 0 0
0 2 6 0 0