Data structure and algorithm – II

Case Study On Tree Data Structure

Invented Time & Use in Com.
Tree Name Use in Real Life Advantages Disadvantages Key Feature Complexity
Inventor Sci.
Binary 1960 by P.F. Contact Searching, Logarithmic Unbalanced Ordered Time: O(log
Search Tree Windley, Management, Sorting, search time trees can structure, n) in
(BST) A.D. Booth, File Systems, Symbol Tables, degrade Dynamic balanced
A.J.T. Colin, and Organizational Database performance adaptability trees
T.N. Hibbard Charts, Indexing, O(n) in not
Dictionary Priority Queues, balanced
Algo. by Conway Self-Balancing trees
Berners-Lee Trees Space: O(n)
and David Wheeler

Splay Tree 1985 by Daniel Caching Systems, Dynamic Self- Increased cost Adaptive Time: O(log
Sleator and Robert Network Routing Memory adjusting, for strict restructuring, n)
Tarjan tables, Allocation, have balancing, Amortized self- Space: O(n)
File Systems, Caching Algo., amortized making them adjusting
DBMS, Graph Alog., time less predictable property
Natural Language Text Processing, complexity, than other
Processing, making them balanced tree,
Web Browsers faster than may not be
many other suitable for
balanced tree certain
data applications
structures in where
some cases. predictable
performance is
required.

B-Tree 1970 by Rudolf File Systems, Database self- based on disk- Multi-level Time:
Bayer and Edward Databases Indexing, balancing, based data indexing, O(log n)
M. McCreight Indexing, Search Trees, High- structures and Node capacity

Enrollment No.: 22C1132 1 Name: Parth Yadav

 Data structure and algorithm – II
External Sorting, Multilevel concurrency can have a high flexibility Space: O(n)
File organization Indexing, and high- disk usage,
on Disk, Concurrency throughput, Not the best for
Network and File Control, File Efficient all cases,
System Allocation, storage Slow in
Implementations Geographic Info. utilization. comparison to
Systems other data
structures.

2-3 Tree 1970 by John File Systems, Search Trees, Balanced More complex Node with 2 or Time:
Hopcroft Databases, Database structure, than B-trees, 3 keys, O(log n)
Memory indexing, Efficient less used in Balance is
Management, Sorting algo., operations practice maintained Space: O(n)
Network Routing, Symbol Tables,
Memory
Databases,
Graph
Algorithms

AVL Tree 1962 by Georgy Database Searching, self-balance difficult to Strictly Time:
Adelson-Velsky and Indexing, Self- Symbol Tables, themselves, implement, balanced, O(log n)
Evgenii Landis Balancing Databases, surely not high constant Automatic
Structures, Graph skewed, factors for some balancing Space: O(n)
Memory Alogorithms, provides of the
management, Concurrency faster operations,
Control in lookups than Less used
Databases Red-Black compared to
Trees, Red-Black trees,
Better Take more
searching processing for
time balancing

Enrollment No.: 22C1132 2 Name: Parth Yadav

 Data structure and algorithm – II
complexity,
Height
cannot
exceed
log(N)

Red-Black 1978 by Leonidas J. File Systems, Searching, self- require one Balance Time:
Tree Guibas and Robert Database Self-Balancing balancing, extra bit of maintenance, O(log n)
Sedgewick Indexing, Structures, can be used storage for each Color-coded
Memory Complier in a wide node to store the nodes Space: O(n)
Management, Implementations, range of color of the
Concurrency Graph applications node,
Control in Algorithms, due to their Complexity of
Databases Network efficient Implementation,
Routing Tables, performance may not be the
implement CPU and best choice for
Scheduling versatility, certain types of
Linux, data or specific
use cases.

Trie 1960 by Edward Spell Checking, Searching, Prefix Efficient for Space Prefix tree, Fast Time:
Fredkin, Axel Thue, IP Routing Matching string-related consumption for string-related O(n)
and René de la Tables, operations, dense datasets operations
Briandais Google Search help with Space: O(1)
longest prefix
matching,
when we
want to find
the key.

Enrollment No.: 22C1132 3 Name: Parth Yadav