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

Recall & Review

beginner

What is a key characteristic of a tree data structure?

A tree organizes data in a hierarchy with nodes connected by edges, where each node can have multiple children but only one parent (except the root).

beginner

How does an array store data compared to a tree?

An array stores data in a continuous block of memory with elements accessed by index, without any inherent hierarchy between elements.

beginner

Why is a linked list less suitable than a tree for representing hierarchical data?

A linked list is a linear structure where each element points to the next, so it cannot naturally represent multiple branches or levels of hierarchy.

intermediate

In what scenario is a tree preferred over arrays and linked lists?

When data has a natural hierarchical relationship, like file systems or organizational charts, trees efficiently represent parent-child connections.

intermediate

What is a disadvantage of using arrays for hierarchical data?

Arrays lack flexibility for dynamic hierarchy changes and require complex indexing or additional structures to represent parent-child relationships.

Which data structure naturally represents hierarchical relationships?

A Array

B Tree

C Linked List

D Stack

Trees organize data in parent-child relationships, making them ideal for hierarchies.

What is a main limitation of linked lists for hierarchical data?

A They have fixed size

B They use too much memory

C They only allow linear connections

D They do not store data

Linked lists connect elements in a single line, so they cannot represent multiple branches.

How does an array access elements?

A By index

B By parent node

C By pointer

D By key

Arrays store elements in continuous memory and access them using numeric indexes.

Which data structure is best for dynamic hierarchical data with frequent insertions?

A Tree

B Array

C Static array

D Fixed linked list

Trees allow flexible insertion and deletion of nodes in a hierarchy.

Why might arrays be inefficient for representing hierarchies?

A They do not allow duplicates

B They cannot store numbers

C They are too slow to access

D They require complex indexing for parent-child links

Arrays do not have built-in hierarchy, so extra logic is needed to represent relationships.

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 multiple levels and branches.

Practice

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

easy

A. Stack

B. Tree

C. Linked List

D. Array

Solution

1. Step 1: Understand hierarchy representation

   Hierarchical data means elements have parent-child relationships, like a family tree.

2. Step 2: Match data structure to hierarchy

   Trees naturally represent hierarchy with nodes connected to children, unlike arrays or linked lists which are linear.

3. Final Answer:

   Tree -> Option B

4. Quick Check:

   Hierarchy needs Tree [OK]

Hint: Hierarchy means parent-child links, use Tree [OK]

Common Mistakes:

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

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

easy

A. struct Node { int data; Node& next; };

B. struct Node { int data; Node next; };

C. struct Node { int data; Node next*; };

D. struct Node { int data; Node* next; };

Solution

1. Step 1: Check pointer usage in struct

   Linked list nodes must point to next node using a pointer type (Node*).

2. Step 2: Validate syntax correctness

   struct Node { int data; Node* next; }; uses Node* next; which is correct pointer syntax. Others have invalid pointer or reference syntax.

3. Final Answer:

   struct Node { int data; Node* next; }; -> Option D

4. Quick Check:

   Pointer to next node uses Node* [OK]

Hint: Use Node* for next pointer in linked list node [OK]

Common Mistakes:

• Using Node next instead of Node* next
• Using reference Node& which is invalid here
• Incorrect pointer syntax like next*

3. What will be the output of the following C++ code snippet?

struct Node {
  int data;
  Node* next;
};

int main() {
  Node a{1, nullptr};
  Node b{2, &a};
  Node* head = &b;
  while (head) {
    std::cout << head->data << " ";
    head = head->next;
  }
  return 0;
}

medium

A. 1

B. 1 2

C. 2 1

D. 2

Solution

1. Step 1: Understand node linking

   Node b points to a, so list order is b -> a.

2. Step 2: Trace the while loop output

   Prints b.data (2), then a.data (1), then nullptr ends loop.

3. Final Answer:

   2 1 -> Option C

4. Quick Check:

   Linked list prints 2 then 1 [OK]

Hint: Follow next pointers to print nodes in order [OK]

Common Mistakes:

• Assuming order is a then b
• Confusing pointer directions
• Printing only first node

4. Identify the error in this code snippet that tries to create a tree node in C++:

struct TreeNode {
  int val;
  TreeNode* left;
  TreeNode* right;
};

int main() {
  TreeNode root;
  root.val = 10;
  root.left = nullptr;
  root.right = nullptr;
  root.left->val = 5;
  return 0;
}

medium

A. Dereferencing nullptr in root.left->val

B. Missing semicolon after struct definition

C. Incorrect pointer declaration for left and right

D. root.val should be initialized with new keyword

Solution

1. Step 1: Analyze pointer initialization

   root.left is set to nullptr, so it points to nothing.

2. Step 2: Check pointer dereference

   Accessing root.left->val dereferences nullptr causing runtime error.

3. Final Answer:

   Dereferencing nullptr in root.left->val -> Option A

4. Quick Check:

   Cannot access member via nullptr [OK]

Hint: Never dereference nullptr pointers [OK]

Common Mistakes:

• Ignoring nullptr before dereference
• Thinking struct needs semicolon error
• Confusing pointer declaration syntax

5. You want to store a company's organizational chart where each employee can have multiple subordinates. Which data structure is best and why? A) Array because it stores data contiguously B) Tree because it naturally models multiple children per node C) Linked List because it allows dynamic size D) Stack because it supports last-in-first-out access

hard

A. Tree because it naturally models multiple children per node

B. Array because it stores data contiguously

C. Linked List because it allows dynamic size

D. Stack because it supports last-in-first-out access

Solution

1. Step 1: Understand organizational chart structure

   Each employee can have multiple subordinates, forming a hierarchy with multiple children per node.

2. Step 2: Match data structure to hierarchy with multiple children

   Trees allow nodes to have multiple children, perfect for this use case. Arrays and linked lists are linear, stacks are LIFO.

3. Final Answer:

   Tree because it naturally models multiple children per node -> Option A

4. Quick Check:

   Multiple children per node means Tree [OK]

Hint: Multiple children? Use Tree for hierarchy [OK]

Common Mistakes:

• Choosing Array for hierarchy
• Choosing Linked List for multiple children
• Confusing Stack with hierarchical needs