Tree vs Array vs Linked List When Hierarchy Matters in DSA Javascript - 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 sequence without inherent hierarchy or parent-child links.

intermediate

Why might a Linked List be less suitable than a Tree when hierarchy matters?

A Linked List connects elements linearly, so it cannot represent branching or multiple child nodes like a Tree can.

beginner

In what scenario is a Tree preferred over an Array or Linked List?

When you need to represent hierarchical data like file systems, organization charts, or nested menus, Trees are preferred.

beginner

What is a limitation of Arrays when representing hierarchical data?

Arrays do not naturally show parent-child relationships, making it hard to represent nested or branching structures.

Which data structure best represents a family tree?

A Stack

B Tree

C Linked List

D Array

A Tree shows parent-child relationships clearly, which is essential for a family tree.

What is a main characteristic of a Linked List?

A Fixed size storage

B Hierarchical branching

C Random access to elements

D Linear sequence of nodes

Linked Lists connect nodes in a linear sequence, not hierarchical branches.

Why is an Array not ideal for hierarchical data?

A It uses too much memory

B It cannot store data

C It stores data linearly without hierarchy

D It is too slow

Arrays store data in a flat sequence, lacking parent-child links needed for hierarchy.

Which data structure allows multiple children per node?

A Tree

B Linked List

C Array

D Queue

Trees allow nodes to have multiple children, representing branching structures.

If you need to traverse data in a strict order without hierarchy, which is best?

A Array

B Graph

C Tree

D Linked List

Arrays store data in order and allow easy access by index, suitable for linear traversal.

Explain how Trees, Arrays, and Linked Lists differ when representing hierarchical data.

Think about how each structure connects or organizes elements.

Describe a real-life example where a Tree is better than an Array or Linked List.

Consider situations with branching and levels.

Practice

1. Which data structure is best suited to represent a family tree where each person can have multiple children?

easy

A. Stack

B. Array

C. Linked List

D. Tree

Solution

1. Step 1: Understand the hierarchy requirement

   A family tree has a parent-child relationship with multiple children per parent, which is a hierarchical structure.

2. Step 2: Match data structure to hierarchy

   Trees naturally represent hierarchical data with nodes and branches, allowing multiple children per node.

3. Final Answer:

   Tree -> Option D

4. Quick Check:

   Hierarchy with multiple children = Tree [OK]

Hint: Hierarchy with multiple children? Use Tree [OK]

Common Mistakes:

• Choosing Array which is linear, not hierarchical
• Choosing Linked List which supports only one next node
• Confusing Stack with hierarchical structure

2. Which of the following is the correct way to declare a linked list node in JavaScript?

easy

A. const node = { value: 5, next: null };

B. const node = [5, null];

C. const node = new Array(5, null);

D. const node = { next: 5, value: null };

Solution

1. Step 1: Understand linked list node structure

   A linked list node typically has a value and a pointer to the next node (next).

2. Step 2: Check each option for correct syntax

   const node = { value: 5, next: null }; correctly uses an object with 'value' and 'next' keys. Others either use arrays or swap keys incorrectly.

3. Final Answer:

   const node = { value: 5, next: null }; -> Option A

4. Quick Check:

   Linked list node = object with value and next [OK]

Hint: Linked list node = object with value and next [OK]

Common Mistakes:

• Using arrays instead of objects for nodes
• Swapping value and next keys
• Using Array constructor incorrectly

3. What will be the output of the following JavaScript code that builds a simple tree structure?

const tree = {
  value: 'root',
  children: [
    { value: 'child1', children: [] },
    { value: 'child2', children: [
      { value: 'grandchild1', children: [] }
    ] }
  ]
};

console.log(tree.children[1].children[0].value);

medium

A. "grandchild1"

B. "child2"

C. "child1"

D. undefined

Solution

1. Step 1: Trace the tree object structure

   The root has two children: 'child1' and 'child2'. 'child2' has one child: 'grandchild1'.

2. Step 2: Access the nested value

   tree.children[1] is 'child2', its children[0] is 'grandchild1', so accessing value gives 'grandchild1'.

3. Final Answer:

   "grandchild1" -> Option A

4. Quick Check:

   tree.children[1].children[0].value = "grandchild1" [OK]

Hint: Follow children indices step-by-step [OK]

Common Mistakes:

• Confusing child indices (0 vs 1)
• Assuming children is a single node, not array
• Accessing wrong property name

4. The following code attempts to create a linked list but has an error. What is the error?

const node1 = { value: 1, next: null };
const node2 = { value: 2, next: null };
node1.next = node2;
node2.next = node1;
console.log(node1.next.next.value);

medium

A. node2.next should be null, not node1

B. node1.next is null, so accessing next.next causes error

C. It creates an infinite loop by linking nodes circularly

D. Syntax error in object declaration

Solution

1. Step 1: Analyze the linked list connections

   node1.next points to node2, and node2.next points back to node1, creating a circular link.

2. Step 2: Understand the effect of circular links

   Accessing node1.next.next.value goes from node1 to node2, then back to node1, causing infinite traversal if looped.

3. Final Answer:

   It creates an infinite loop by linking nodes circularly -> Option C

4. Quick Check:

   Circular links cause infinite loops [OK]

Hint: Check if next points back to previous node [OK]

Common Mistakes:

• Ignoring circular reference causing infinite loop
• Assuming next.next is null
• Thinking it's a syntax error

5. You have a nested array representing a company's hierarchy like this:

const company = [
  { name: 'CEO', reports: [
    { name: 'Manager1', reports: [] },
    { name: 'Manager2', reports: [
      { name: 'Employee1', reports: [] }
    ] }
  ] }
];

Which data structure would be best to convert this into for efficient traversal and why?

hard

A. Convert to a Linked List because it allows easy sequential access to employees.

B. Convert to a Tree because it naturally represents hierarchical relationships with multiple children.

C. Convert to a flat Array because arrays are faster to traverse than trees.

D. Convert to a Stack because it helps in depth-first traversal.

Solution

1. Step 1: Understand the nested array structure

   The company hierarchy has multiple levels with managers and employees reporting to them, forming a hierarchy.

2. Step 2: Choose data structure matching hierarchy and traversal needs

   Trees represent hierarchical data with nodes and children, making traversal and queries efficient and natural.

3. Final Answer:

   Convert to a Tree because it naturally represents hierarchical relationships with multiple children. -> Option B

4. Quick Check:

   Hierarchical data = Tree for efficient traversal [OK]

Hint: Hierarchy with multiple levels? Use Tree [OK]

Common Mistakes:

• Choosing Linked List which is linear, not hierarchical
• Choosing flat Array losing hierarchy info
• Confusing Stack with data structure for storage