Why Trees Exist and What Linked Lists and Arrays Cannot Do in DSA Typescript - Why It Works

Concept Flow - Why Trees Exist and What Linked Lists and Arrays Cannot Do

Start: Need to store data

↓

Try Array

→Fixed size, slow search

↓

Try Linked List

→Dynamic size, slow search

↓

Need fast search & hierarchy

↓

Use Tree Structure

↓

Store data in nodes with children

↓

Fast search, hierarchical data, flexible size

Shows why arrays and linked lists fall short for some tasks and how trees solve these by organizing data hierarchically for fast search and flexible structure.

Execution Sample

DSA Typescript

Array: [10, 20, 30, 40]
LinkedList: 10 -> 20 -> 30 -> 40 -> null
Tree:
    20
   /  \
 10    30
          \
           40

Shows data stored in array, linked list, and tree forms to compare structure and access.

Execution Table

Step	Operation	Data Structure	Limitations / Advantages	Visual State
1	Store 4 elements in Array	Array	Fixed size, slow search if unsorted	[10, 20, 30, 40]
2	Store 4 elements in Linked List	Linked List	Dynamic size, slow search (linear)	10 -> 20 -> 30 -> 40 -> null
3	Store 4 elements in Tree	Tree	Hierarchical, fast search (log n), flexible	20 / \ 10 30 \ 40
4	Search for 30 in Array	Array	Must check each element	Search linear: 10, 20, 30 (found)
5	Search for 30 in Linked List	Linked List	Must traverse nodes one by one	Traverse: 10 -> 20 -> 30 (found)
6	Search for 30 in Tree	Tree	Compare and go left/right, faster	At 20: go right -> 30 (found)
7	Add 25 to Array	Array	Fixed size, need resize	Resize needed to add element
8	Add 25 to Linked List	Linked List	Add at end easily	10 -> 20 -> 30 -> 40 -> 25 -> null
9	Add 25 to Tree	Tree	Add maintaining order	20 / \ 10 30 / \ 25 40
10	Conclusion	Tree	Trees handle hierarchy and fast search better than arrays or lists	Hierarchical structure with fast access

💡 Trees provide hierarchical structure and faster search, overcoming array and linked list limitations.

Variable Tracker

Data Structure	Initial State	After Adding Elements	After Search	Final State
Array	[]	[10, 20, 30, 40]	Search linear through elements	[10, 20, 30, 40]
Linked List	null	10 -> 20 -> 30 -> 40 -> null	Traverse nodes one by one	10 -> 20 -> 30 -> 40 -> 25 -> null
Tree	empty	20 / \ 10 30 \ 40	Compare nodes left/right	20 / \ 10 30 / \ 25 40

Key Moments - 3 Insights

Why can't arrays handle dynamic size easily?

Arrays have fixed size; adding elements beyond capacity requires creating a new larger array and copying elements, as shown in execution_table step 7.

Why is searching slow in linked lists compared to trees?

Linked lists require checking each node one by one (step 5), while trees use comparisons to skip large parts of data (step 6), making search faster.

How do trees organize data differently from arrays and linked lists?

Trees store data in nodes with children forming a hierarchy (step 3 and 9), allowing faster search and representing relationships, unlike linear arrays or lists.

Visual Quiz - 3 Questions

Look at the execution_table at step 6, how does the tree find 30 faster than the linked list?

A By comparing and moving left or right child nodes

B By checking every element one by one

C By resizing the data structure

D By storing elements in a fixed order

💡 Hint

See step 6 in execution_table where tree compares and goes right to find 30 quickly.

At which step does the array need resizing to add a new element?

A Step 3

B Step 9

C Step 7

D Step 5

💡 Hint

Check step 7 in execution_table where adding 25 to array requires resize.

According to variable_tracker, which data structure shows a change from empty to hierarchical nodes?

A Array

B Tree

C Linked List

D None

💡 Hint

Look at variable_tracker row for Tree showing empty to hierarchical structure.

Concept Snapshot

Why Trees Exist and What Linked Lists and Arrays Cannot Do

- Arrays: fixed size, slow search if unsorted
- Linked Lists: dynamic size, slow linear search
- Trees: hierarchical nodes, fast search (log n), flexible size
- Trees solve problems of slow search and lack of hierarchy
- Use trees for data with relationships and fast lookup

Full Transcript

This lesson shows why arrays and linked lists are not enough for some data storage needs. Arrays have fixed size and slow search if unsorted. Linked lists can grow but still search slowly by checking nodes one by one. Trees organize data in nodes with children, forming a hierarchy. This lets trees search faster by comparing and moving left or right, skipping many elements. Trees also handle dynamic size and represent relationships naturally. The execution steps show storing, searching, and adding elements in arrays, linked lists, and trees, highlighting their differences and advantages. Trees exist to overcome the limitations of arrays and linked lists, especially for fast search and hierarchical data.