Tree vs Array vs Linked List When Hierarchy Matters in DSA Typescript - Key Differences

Recall & Review

beginner

What is a key feature of a tree data structure?

A tree organizes data in a hierarchy with a root node and child nodes, showing parent-child relationships clearly.

beginner

How does an array store data compared to a tree?

An array stores data in a flat, linear order without hierarchy, using indexes to access elements directly.

beginner

What is the main difference between a linked list and an array?

A linked list stores elements in nodes connected by pointers, allowing dynamic size and easy insertion/removal, unlike fixed-size arrays.

intermediate

Why is a tree preferred when hierarchy matters?

Because trees represent parent-child relationships naturally, making it easy to model structures like file systems or organization charts.

intermediate

Can an array represent hierarchical data effectively? Why or why not?

Arrays can store hierarchical data but do not show relationships clearly; extra logic is needed to interpret hierarchy, unlike trees.

Which data structure naturally shows parent-child relationships?

A Stack

B Tree

C Linked List

D Array

Trees organize data in a hierarchy with clear parent-child links.

Which data structure allows dynamic size and easy insertion/removal?

A Linked List

B Array

C Tree

D Queue

Linked lists use pointers to connect nodes, allowing flexible size and easy changes.

What is a limitation of using arrays for hierarchical data?

A Fixed size and no direct parent-child links

B Too slow to access elements

C Uses too much memory

D Cannot store numbers

Arrays store data linearly and do not show hierarchy without extra logic.

Which data structure is best for representing a file system hierarchy?

A Hash Table

B Linked List

C Array

D Tree

Trees naturally model hierarchical structures like file systems.

In a linked list, how are elements connected?

A By indexes

B By keys

C By pointers or references

D By values

Linked list nodes hold pointers to the next node, linking elements dynamically.

Explain when and why you would choose a tree over an array or linked list for storing data.

Think about how data is connected and what structure shows relationships clearly.

Describe the main differences between arrays, linked lists, and trees in terms of structure and use cases.

Consider how data is stored and accessed in each structure.

Practice

1. Which data structure is best suited to represent hierarchical relationships like a family tree or company organization?

easy

A. Tree

B. Array

C. Linked List

D. Stack

Solution

1. Step 1: Understand hierarchy representation

   Hierarchies have parent-child relationships, which are naturally modeled by trees.

2. Step 2: Compare data structures

   Arrays and linked lists are linear and do not represent branching well, unlike trees.

3. Final Answer:

   Tree -> Option A

4. Quick Check:

   Hierarchy = Tree [OK]

Hint: Hierarchy means branching, so choose Tree [OK]

Common Mistakes:

• Choosing Array because it's simple
• Choosing Linked List thinking it can represent hierarchy
• Confusing Stack with hierarchical structure

2. Which of the following is the correct TypeScript syntax to declare a simple linked list node with a value and a next pointer?

easy

A. class Node { value: number; next: Node; constructor(value: number) { this.value = value; this.next = null; } }

B. class Node { value: number; next: Node | null; constructor(value: number) { this.value = value; this.next = null; } }

C. class Node { value: number; next: null; constructor(value: number) { this.value = value; this.next = null; } }

D. class Node { value: number; next: any; constructor(value: number) { this.value = value; this.next = undefined; } }

Solution

1. Step 1: Check next pointer type

   Next pointer should allow either another Node or null to mark list end.

2. Step 2: Verify constructor initialization

   Constructor sets value and initializes next to null correctly.

3. Final Answer:

   class Node { value: number; next: Node | null; constructor(value: number) { this.value = value; this.next = null; } } -> Option B

4. Quick Check:

   Next pointer = Node or null [OK]

Hint: Next pointer must allow null for list end [OK]

Common Mistakes:

• Not allowing null for next pointer
• Initializing next as undefined instead of null
• Using any type which loses type safety

3. Given the following TypeScript code, what will be the printed output?

class TreeNode {
  value: number;
  children: TreeNode[];
  constructor(value: number) {
    this.value = value;
    this.children = [];
  }
}

const root = new TreeNode(1);
const child1 = new TreeNode(2);
const child2 = new TreeNode(3);
root.children.push(child1, child2);
console.log(root.children.map(c => c.value));

medium

A. [1, 2, 3]

B. Error: children is not iterable

C. [[2], [3]]

D. [2, 3]

Solution

1. Step 1: Understand tree structure

   Root node has value 1 and two children with values 2 and 3.

2. Step 2: Analyze console.log output

   Mapping children array extracts values [2, 3], root's value 1 is not included.

3. Final Answer:

   [2, 3] -> Option D

4. Quick Check:

   Children values = [2, 3] [OK]

Hint: Mapping children prints their values, not root's [OK]

Common Mistakes:

• Including root value in output
• Expecting nested arrays instead of flat array
• Assuming children is not iterable

4. Identify the bug in this TypeScript code that tries to create a linked list and print its values:

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

const head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);

let current = head;
while (current !== null) {
  console.log(current.value);
  current = current.next.next;
}

medium

A. Using console.log inside loop is invalid

B. Incorrect constructor syntax

C. Accessing next.next without checking if next is null

D. Node class missing a previous pointer

Solution

1. Step 1: Trace the while loop iteration

   Loop moves current by current.next.next, skipping nodes and risking null access.

2. Step 2: Identify null pointer risk

   When current.next is null, accessing current.next.next causes runtime error.

3. Final Answer:

   Accessing next.next without checking if next is null -> Option C

4. Quick Check:

   Null check missing before next.next access [OK]

Hint: Always check next before accessing next.next [OK]

Common Mistakes:

• Ignoring null checks causing runtime errors
• Thinking constructor syntax is wrong
• Believing console.log causes errors

5. You need to represent a company's organizational chart where each employee can have multiple direct reports. Which data structure should you use and why? Choose the best option and explain your reasoning.

hard

A. Tree, because it naturally models hierarchical relationships with multiple children

B. Linked List, because it allows dynamic insertion and deletion of employees

C. Stack, because it supports last-in-first-out operations suitable for reporting

D. Array, because it stores elements in order and is easy to access by index

Solution

1. Step 1: Analyze the problem requirements

   Organizational chart has hierarchy with employees having multiple direct reports (children).

2. Step 2: Match data structure to hierarchy

   Tree structure supports nodes with multiple children, representing managers and their reports well.

3. Step 3: Evaluate other options

   Array and linked list are linear and do not represent branching; stack is for LIFO, not hierarchy.

4. Final Answer:

   Tree, because it naturally models hierarchical relationships with multiple children -> Option A

5. Quick Check:

   Hierarchy with multiple children = Tree [OK]

Hint: Hierarchy with multiple children means Tree is best [OK]

Common Mistakes:

• Choosing Array for hierarchy
• Thinking Linked List handles multiple children well
• Confusing Stack with hierarchical data