Scribd
Upload
31 views2 pages

Dsa 2nd Assignment - 241106 - 153553

Uploaded by

sumukhchavan6
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
31 views2 pages

Dsa 2nd Assignment - 241106 - 153553

Uploaded by

sumukhchavan6
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

Assignment -2

Subject: Data Structure & Application

Display Date: 22-11-2024 Submission Date: 29-11-2024

1. Define Doubly Linked List. Write c functions of insert delete display


functions

2. What is binary tree? Briefly explain skewed, strictly, complete, almost, and
Extended binary tree with diagram.

3. Write the routines for Binary tree traversals inorder, preorder,postorder .

4. Explain Threaded binary tree with an examples.

5. Write algorithm to implement for recursive search & insert for a binary
search tree.

6.Define binary search tree. and also For the given data draw a binary search
tree and show the array and linked representation of the same 43, 10, 79, 90,
12, 54, 11, 9, 50

7. Explain selection tree with an examples

8. Define set. And how do you represent disjoint sets .

9.What is forest and transform given forest tree to binary tree

10.Define graph, indegree, outdegree, selfedge or selfloops ,complete graph,


multigraph

11.Represent the given graph into adjacency matrix and adjacency linked list.
12. What are the graph Traversals explain briefly And also write the traversals
for the following graphs.

13.Define hash. Briefly explain hashing functions

14.What are the collision resolving strategies explain Linear Probing technology

15.Explain dynamic hashing with examples

16.Define priority queue. Explain the following i)Leftist tree, ii) weight biased
tree and iii)height biased tree

17.Define optimal binary search tree. Construct optimal binary search tree for
the given data. Let n=4 and
(a1,a2,a3,a4)=(10,15,20,25).
(p1,p2,p3,p4)=(3,3,1,1) and
(q0,q1,q2,q3,q4)=(2,3,1,1,1)

You might also like