Scribd
Upload
2 views1 page

ADS Assignment 1

Uploaded by

akshay rawat
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 views1 page

ADS Assignment 1

Uploaded by

akshay rawat
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/ 1

1.

Explain the differences between a binary tree, binary search tree (BST), and
balanced binary tree (e.g., AVL or Red-Black Tree). How do they ensure
efficient operations?
2. What is a B-Tree, and where is it used? Explain how it differs from a Binary
Search Tree (BST) in terms of structure and performance.
3. Describe the various types of heaps (min-heap, max-heap, Fibonacci heap).
Provide examples of their applications in computer science.
4. Explain how hashing works. What are hash functions, and how are collisions
handled in hash tables?
5. What is a Trie (prefix tree)? Explain its structure and provide an example of its
use in efficient searching or dictionary-based applications.
6. Compare and contrast different graph representations: adjacency matrix vs
adjacency list. Discuss the trade-offs in terms of space and time complexity.
7. What is a self-balancing tree (e.g., AVL Tree, Red-Black Tree)? Explain how
rotations maintain the balance property during insertions and deletions.
8. Explain the concept of Disjoint Set Union (Union-Find) data structure. How is it
used in algorithms like Kruskal’s Minimum Spanning Tree?
9. Describe the Segment Tree and its applications. How is it used for range
queries, and how does it compare to Binary Indexed Trees (Fenwick Trees)?
10. What is a Skip List? How does it provide efficient search performance, and
how does it compare to other data structures like balanced trees?

You might also like