Why Trees Exist and What Linked Lists and Arrays Cannot Do in DSA Javascript - Performance Analysis

Time Complexity: Why Trees Exist and What Linked Lists and Arrays Cannot Do

O(n)

Understanding Time Complexity

We want to understand why trees are used instead of just arrays or linked lists.

What problems do trees solve that arrays and linked lists cannot handle efficiently?

Scenario Under Consideration

Analyze the time complexity of searching for a value in different data structures.

// Search in an array
function searchArray(arr, target) {
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] === target) return true;
  }
  return false;
}

// Search in a binary tree (simplified)
function searchTree(node, target) {
  if (!node) return false;
  if (node.value === target) return true;
  return searchTree(node.left, target) || searchTree(node.right, target);
}
    

The code shows searching in an array and searching in a tree structure.

Identify Repeating Operations

Look at what repeats when searching.

• Primary operation: Checking each element or node for the target value.
• How many times: In array, up to n times (each element). In tree, up to n nodes visited in worst case.

How Execution Grows With Input

As the number of items grows, how does searching time grow?

Input Size (n)	Approx. Operations in Array	Approx. Operations in Tree
10	Up to 10 checks	Up to 10 node visits
100	Up to 100 checks	Up to 100 node visits
1000	Up to 1000 checks	Up to 1000 node visits

Pattern observation: Both grow linearly if tree is unorganized, but trees can be structured to reduce this.

Final Time Complexity

Time Complexity: O(n)

This means searching can take time proportional to the number of items when data is not organized.

Common Mistake

[X] Wrong: "Trees always make searching faster than arrays or linked lists."

[OK] Correct: If the tree is not balanced or organized, searching can still take as long as checking every item.

Interview Connect

Understanding why trees exist helps you explain when to use them and how they improve searching and organizing data.

Self-Check

"What if the tree is a balanced binary search tree? How would the time complexity of searching change?"

Practice

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

easy

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

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

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

D. Because trees always store data in sorted order unlike arrays and linked lists.

Solution

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

   Arrays and linked lists store data linearly, so they cannot naturally represent parent-child or hierarchical relationships.

2. Step 2: Identify the unique feature of trees

   Trees allow nodes 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 A

4. Quick Check:

   Hierarchy needs trees = B [OK]

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

Common Mistakes:

• Thinking trees use less memory than arrays
• Believing trees are simpler to implement
• Assuming trees always store sorted data

2. Which of the following is the correct way to create a simple tree node object in JavaScript?

easy

A. const node = new TreeNode(5, []);

B. const node = { value: 5, children: [] };

C. const node = (value: 5, children: []);

D. const node = [5, []];

Solution

1. Step 1: Recall JavaScript object syntax

   Objects use curly braces with key-value pairs, like { key: value }.

2. Step 2: Check each option

   const node = { value: 5, children: [] }; uses correct object syntax with keys 'value' and 'children'. const node = [5, []]; is an array, not an object. const node = (value: 5, children: []); uses invalid syntax. const node = new TreeNode(5, []); assumes a class TreeNode which is not defined.

3. Final Answer:

   const node = { value: 5, children: [] }; -> Option B

4. Quick Check:

   JS object syntax = D [OK]

Hint: JS objects use curly braces with key-value pairs [OK]

Common Mistakes:

• Using array syntax instead of object
• Using invalid parentheses syntax
• Assuming class exists without definition

3. What will be the output of the following code that creates a simple tree and prints the root's first child's value?

const root = { value: 1, children: [ { value: 2, children: [] }, { value: 3, children: [] } ] };
console.log(root.children[0].value);

medium

A. undefined

B. 1

C. 3

D. 2

Solution

1. Step 1: Understand the tree structure

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

2. Step 2: Access the first child's value

   root.children[0] refers to the first child node with value 2, so root.children[0].value is 2.

3. Final Answer:

   2 -> Option D

4. Quick Check:

   root.children[0].value = 2 [OK]

Hint: Index 0 child value is root.children[0].value [OK]

Common Mistakes:

• Printing root.value instead of child's
• Using wrong index for children
• Confusing children array with object

4. Find the error in this code that tries to add a child node to a tree:

const root = { value: 10, children: [] };
root.children.push({ value: 20 });
console.log(root.children[0].value);

medium

A. The root node should not have a 'children' property.

B. The push method cannot be used on arrays.

C. The child node is missing the 'children' array property.

D. The console.log syntax is incorrect.

Solution

1. Step 1: Check the child node structure

   The child node added has only 'value' but no 'children' array, which breaks the tree node structure.

2. Step 2: Understand tree node consistency

   Each node should have a 'children' property as an array, even if empty, to maintain uniformity.

3. Final Answer:

   The child node is missing the 'children' array property. -> Option C

4. Quick Check:

   Missing children array in child node = A [OK]

Hint: Every tree node needs a children array [OK]

Common Mistakes:

• Thinking push is invalid on arrays
• Believing root shouldn't have children
• Assuming console.log syntax is wrong

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

hard

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

B. Use an array because it allows fast access to any employee by index.

C. Use a linked list because it is simple and efficient for sequential access.

D. Use a stack because it stores employees in last-in-first-out order.

Solution

1. Step 1: Analyze the problem requirements

   The organizational chart has a hierarchy where each employee can have many subordinates, forming a tree-like structure.

2. Step 2: Compare data structures

   Arrays and linked lists are linear and cannot represent multiple children per node naturally. Trees allow each node to have multiple children, matching the hierarchy.

3. Final Answer:

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

4. Quick Check:

   Hierarchy with multiple children = tree = C [OK]

Hint: Hierarchy with multiple children needs trees, not linear lists [OK]

Common Mistakes:

• Choosing arrays for hierarchical data
• Using linked lists for multi-child nodes
• Confusing stack usage with hierarchy