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

Why Trees Exist and What Linked Lists and Arrays Cannot Do

📖 Scenario: Imagine you are organizing a family reunion. You want to keep track of family members and their relationships, like parents and children. Using simple lists or arrays makes it hard to show these connections clearly. Trees help us organize such data naturally.

🎯 Goal: Build a simple tree structure in TypeScript to represent family members and their children. Understand why linked lists and arrays cannot easily show these parent-child relationships.

📋 What You'll Learn

Create a tree node structure with a name and children

Add children to a parent node

Traverse the tree to print family members and their children

Show why arrays or linked lists alone cannot represent this hierarchy

💡 Why This Matters

🌍 Real World

Trees are used to represent hierarchical data like family trees, company structures, file systems, and more.

💼 Career

Understanding trees helps in software development roles involving data organization, search algorithms, and UI component trees.

1

Create a Tree Node Interface

Create an interface called TreeNode with two properties: name of type string and children which is an array of TreeNode.

DSA Typescript

// Define the TreeNode interface
// Your code here

Hint

Think of each family member as a node with a name and a list of children nodes.

2

Create a Root Node with Children

Create a constant root of type TreeNode with name set to 'Grandparent' and children as an array containing two TreeNode objects with names 'Parent1' and 'Parent2', each having empty children arrays.

DSA Typescript

interface TreeNode {
  name: string;
  children: TreeNode[];
}

// Create the root node with two children
// Your code here

Hint

Start with one grandparent node and add two children nodes with empty children arrays.

3

Add a Child to One Parent

Add a child node with name 'Child1' and empty children array to the children array of the Parent1 node inside root.

DSA Typescript

interface TreeNode {
  name: string;
  children: TreeNode[];
}

const root: TreeNode = {
  name: 'Grandparent',
  children: [
    { name: 'Parent1', children: [] },
    { name: 'Parent2', children: [] }
  ]
};

// Add a child named 'Child1' to 'Parent1'
// Your code here

Hint

Find the 'Parent1' node and add a new child node inside its children array.

4

Print the Tree Structure

Write a function printTree that takes a TreeNode and a level number (default 0). It prints the node's name with indentation based on level. Then it calls itself recursively for each child with level + 1. Finally, call printTree(root) to display the family tree.

DSA Typescript

interface TreeNode {
  name: string;
  children: TreeNode[];
}

const root: TreeNode = {
  name: 'Grandparent',
  children: [
    { name: 'Parent1', children: [{ name: 'Child1', children: [] }] },
    { name: 'Parent2', children: [] }
  ]
};

// Write a recursive function to print the tree
// Your code here

Hint

Use indentation to show levels. Call the function recursively for children.

Practice

1. Why do trees exist as a data structure when we already have arrays and linked lists?

easy

A. Because trees are easier to implement than arrays and linked lists.

B. Because trees use less memory than arrays and linked lists.

C. Because trees always have faster access times than arrays and linked lists.

D. Because trees can represent hierarchical relationships which arrays and linked lists cannot.

Solution

1. Step 1: Understand the limitation of arrays and linked lists

   Arrays and linked lists store data in a linear sequence, which makes it hard to represent hierarchical or branching relationships.

2. Step 2: Identify the unique feature of trees

   Trees allow each element to have multiple children, representing hierarchical data like file systems or organization charts.

3. Final Answer:

   Trees represent hierarchical relationships which arrays and linked lists cannot -> Option D

4. Quick Check:

   Hierarchical data needs trees = C [OK]

Hint: Trees model hierarchies; arrays and lists are linear [OK]

Common Mistakes:

• Thinking trees always use less memory
• Believing trees are simpler to implement
• Assuming trees always have faster access

2. Which of the following is the correctly way to declare a simple tree node in TypeScript?

easy

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

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

C. class TreeNode { value: number; prev: TreeNode; constructor(value: number) { this.value = value; this.prev = null; } }

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

Solution

1. Step 1: Identify tree node properties

   A tree node stores a value and multiple children nodes, so it needs a children array.

2. Step 2: Match with the correct class declaration

   class TreeNode { value: number; children: TreeNode[]; constructor(value: number) { this.value = value; this.children = []; } } declares a value and children array, suitable for a tree node. Declarations using next or prev are for linked lists. class TreeNode { value: number; array: number[]; constructor(value: number) { this.value = value; this.array = []; } } uses an array of numbers, not nodes.

3. Final Answer:

   correctly declares a tree node with children array -> Option A

4. Quick Check:

   Tree nodes have children array = A [OK]

Hint: Tree nodes have children arrays, not next or prev pointers [OK]

Common Mistakes:

• Confusing tree nodes with linked list nodes
• Using next or prev instead of children array
• Using array of numbers instead of nodes

3. What will be the output of the following TypeScript code?

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);
root.children.push(child2);
console.log(root.children.length);

medium

A. 0

B. 1

C. 2

D. 3

Solution

1. Step 1: Understand the tree construction

   A root node with value 1 is created. Two child nodes with values 2 and 3 are created and added to root's children array.

2. Step 2: Count the children of root

   Two children are pushed into root.children, so root.children.length is 2.

3. Final Answer:

   2 -> Option C

4. Quick Check:

   Two children added = 2 [OK]

Hint: Count how many children are pushed into the children array [OK]

Common Mistakes:

• Assuming children length is 0 by default
• Confusing children with linked list next pointers
• Counting nodes instead of children array length

4. Find the error in this TypeScript code that tries to create a tree node and add children:

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

const root = new TreeNode(10);
root.children.push(new TreeNode(20));

medium

A. The constructor should not have parameters.

B. children should be initialized as an empty array, not null.

C. The push method does not exist on arrays.

D. TreeNode class should not have a children property.

Solution

1. Step 1: Check children initialization

   children is set to null, so calling push on null causes an error.

2. Step 2: Correct children initialization

   children should be initialized as an empty array [] to allow push method calls.

3. Final Answer:

   children should be initialized as an empty array, not null -> Option B

4. Quick Check:

   push on null causes error = A [OK]

Hint: Initialize children as [] before pushing nodes [OK]

Common Mistakes:

• Setting children to null instead of []
• Trying to push on null causing runtime error
• Ignoring constructor parameters

5. You want to represent a company's organizational chart where each employee can have multiple subordinates. Which data structure is best and why?

Choose the best answer.

hard

A. Use a tree because it naturally models hierarchical relationships with multiple children per node.

B. Use a linked list because it allows easy insertion and deletion of employees.

C. Use a stack because it follows last-in-first-out which suits organizational charts.

D. Use an array because it stores data sequentially and is easy to access.

Solution

1. Step 1: Understand the problem context

   An organizational chart is hierarchical: managers have multiple subordinates, forming branches.

2. Step 2: Match data structure to hierarchy

   Trees allow nodes to have multiple children, perfectly modeling this hierarchy. Arrays and linked lists are linear, stacks are LIFO structures unsuitable here.

3. Final Answer:

   Use a tree because it naturally models hierarchical relationships -> Option A

4. Quick Check:

   Hierarchy needs trees = D [OK]

Hint: Hierarchies need trees, not linear or LIFO structures [OK]

Common Mistakes:

• Choosing arrays or linked lists for hierarchical data
• Confusing stack behavior with organizational needs
• Ignoring multiple children per node requirement