Why Trees Exist and What Linked Lists and Arrays Cannot Do in DSA Go - Quick Recap

Recall & Review

beginner

Why do we need trees when we already have arrays and linked lists?

Trees help organize data hierarchically, allowing faster searching, insertion, and deletion in many cases where arrays and linked lists are slow.

beginner

What is a limitation of arrays that trees can overcome?

Arrays have fixed size and slow insertion/deletion in the middle, while trees can grow dynamically and allow faster updates.

beginner

Why can't linked lists efficiently support hierarchical data?

Linked lists are linear and do not represent parent-child relationships well, unlike trees which naturally model hierarchies.

intermediate

How do trees improve search operations compared to arrays and linked lists?

Balanced trees can perform search in O(log n) time, while arrays and linked lists may require O(n) time for unsorted data.

beginner

What real-life example helps explain why trees are useful?

A family tree shows relationships clearly, which a list or array cannot represent well because it lacks hierarchy.

Which data structure naturally represents hierarchical relationships?

A Array

B Tree

C Linked List

D Stack

Trees model parent-child relationships, making them ideal for hierarchies.

What is a main disadvantage of arrays compared to trees?

A No order of elements

B Cannot store numbers

C Fixed size and slow middle insertions

D Too complex to implement

Arrays have fixed size and inserting in the middle requires shifting elements, which is slow.

Why are linked lists not good for representing hierarchies?

A They are linear and only connect one element to the next

B They use too much memory

C They are slower than arrays

D They cannot store data

Linked lists connect elements in a line, so they cannot show parent-child relationships.

What is the typical search time complexity in a balanced tree?

A O(1)

B O(n)

C O(n log n)

D O(log n)

Balanced trees allow searching in logarithmic time, which is faster than linear search.

Which of these is a real-world example of a tree structure?

A Family tree

B Shopping list

C Queue of customers

D Array of numbers

A family tree shows hierarchical relationships between members.

Explain why trees are better than arrays and linked lists for hierarchical data.

Think about how family or organization structures are shown.

Describe the limitations of arrays and linked lists that trees solve.

Consider size flexibility and data organization.