Why Create a Binary Tree Manually in DSA Typescript?

The Big Idea

What if you could build and manage complex family trees without messy drawings or confusion?

The Scenario

Imagine you want to organize your family tree on paper. You try to draw each person and connect them with lines to show parents and children. As the family grows, the paper becomes messy and hard to update.

The Problem

Manually drawing or tracking relationships is slow and confusing. It's easy to make mistakes, lose track of connections, or forget to update parts. Searching for a specific person or adding new members takes a lot of time.

The Solution

Creating a binary tree in code lets you store each person as a node with links to their left and right children. This structure keeps everything organized and easy to update. You can quickly add, find, or change nodes without confusion.

Before vs After

✗ Before

const root = { value: 1, left: { value: 2 }, right: { value: 3 } };
// Manually linking nodes can get messy

✓ After

class TreeNode {
  value: number;
  left: TreeNode | null = null;
  right: TreeNode | null = null;
  constructor(value: number) {
    this.value = value;
  }
}
const root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);

What It Enables

It enables building clear, organized trees that can grow and change easily, making complex relationships simple to manage.

Real Life Example

Family trees, decision trees in games, or organizing company hierarchies all use binary trees to keep track of connections clearly and efficiently.

Key Takeaways

Manual tracking of tree-like data is confusing and error-prone.

Binary trees store data with clear parent-child links for easy updates.

Using classes to create nodes keeps the structure organized and scalable.

Practice

1. What is the main purpose of manually creating a binary tree in TypeScript?

easy

A. To avoid using classes or objects

B. To automatically sort data without coding

C. To understand how nodes connect and form the tree structure

D. To create a linked list instead of a tree

Solution

1. Step 1: Understand binary tree structure

   A binary tree consists of nodes where each node has at most two children, left and right.

2. Step 2: Purpose of manual creation

   Manually creating a binary tree helps visualize and understand how nodes connect to form the tree.

3. Final Answer:

   To understand how nodes connect and form the tree structure -> Option C

4. Quick Check:

   Manual creation = Understand tree structure [OK]

Hint: Manual creation helps visualize node connections [OK]

Common Mistakes:

• Thinking it automatically sorts data
• Confusing binary tree with linked list
• Assuming no objects or classes are needed

2. Which of the following is the correct way to define a binary tree node class in TypeScript?

easy

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

B. class Node { value: number; left: number; right: number; constructor(value: number) { this.value = value; this.left = 0; this.right = 0; } }

C. class Node { value: number; left: Node; right: Node; constructor(value: number) { this.value = value; } }

D. class Node { value: number; left: any; right: any; constructor() { this.value = 0; } }

Solution

1. Step 1: Check node properties and types

   A binary tree node should have a value and left/right children which can be nodes or null.

2. Step 2: Verify constructor initialization

   Constructor must initialize value and set left and right to null initially.

3. Final Answer:

   class Node { value: number; left: Node | null; right: Node | null; constructor(value: number) { this.value = value; this.left = null; this.right = null; } } -> Option A

4. Quick Check:

   Node class with nullable children = class Node { value: number; left: Node | null; right: Node | null; constructor(value: number) { this.value = value; this.left = null; this.right = null; } } [OK]

Hint: Children must be Node or null, initialized in constructor [OK]

Common Mistakes:

• Using number type for left/right instead of Node or null
• Not initializing left and right to null
• Omitting constructor parameters

3. Given the following TypeScript code to create a binary tree manually, what will be the output of console.log(root.left?.value)?

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

const root = new Node(10);
root.left = new Node(5);
root.right = new Node(15);

medium

A. 5

B. 10

C. 15

D. undefined

Solution

1. Step 1: Understand tree structure from code

   Root node has value 10, left child is node with value 5, right child is node with value 15.

2. Step 2: Access left child's value

   root.left?.value accesses left node's value safely, which is 5.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   root.left.value = 5 [OK]

Hint: Access left child value directly with root.left?.value [OK]

Common Mistakes:

• Confusing root value with left child value
• Expecting right child value instead
• Not using optional chaining and getting error

4. Identify the error in the following TypeScript code that tries to create a binary tree node manually:

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

const root = new Node(10);
root.left = 5;
root.right = new Node(15);

medium

A. Missing constructor parameters in Node class

B. Using wrong class name for Node

C. Not initializing root.right

D. Assigning number 5 to root.left instead of a Node or null

Solution

1. Step 1: Check type of root.left assignment

   root.left is declared as Node or null, but assigned number 5 which is invalid.

2. Step 2: Confirm correct assignment type

   root.left should be assigned a Node instance or null, not a number.

3. Final Answer:

   Assigning number 5 to root.left instead of a Node or null -> Option D

4. Quick Check:

   Type mismatch in root.left assignment = Assigning number 5 to root.left instead of a Node or null [OK]

Hint: Children must be Node or null, not a number [OK]

Common Mistakes:

• Assigning primitive values to node children
• Ignoring type errors in assignments
• Assuming number can be assigned directly

5. You want to manually create a binary tree with root value 20, left child 10, and right child 30. Which code snippet correctly creates this tree and prints the root, left, and right values in order?

hard

A. const root = new Node(20);
root.left = 10;
root.right = 30;
console.log(root.value, root.left, root.right);

B. const root = new Node(20);
root.left = new Node(10);
root.right = new Node(30);
console.log(root.value, root.left?.value, root.right?.value);

C. const root = new Node(20);
root.left = new Node(30);
root.right = new Node(10);
console.log(root.value, root.left?.value, root.right?.value);

D. const root = new Node(20);
root.left = null;
root.right = null;
console.log(root.left?.value, root.value, root.right?.value);

Solution

1. Step 1: Create root and children nodes correctly

   Root node with value 20, left child 10, right child 30 must be Node instances.

2. Step 2: Print values in order root, left, right

   console.log prints root.value, root.left?.value, root.right?.value which outputs 20 10 30.

3. Final Answer:

   const root = new Node(20); root.left = new Node(10); root.right = new Node(30); console.log(root.value, root.left?.value, root.right?.value); -> Option B

4. Quick Check:

   Correct node creation and print order = const root = new Node(20); root.left = new Node(10); root.right = new Node(30); console.log(root.value, root.left?.value, root.right?.value); [OK]

Hint: Create nodes with new, assign children as nodes, print values [OK]

Common Mistakes:

• Assigning numbers directly to children
• Swapping left and right child values
• Printing children before root or using null children