Bottom View of Binary Tree in DSA Typescript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the bottom view of a binary tree?

The bottom view of a binary tree is the set of nodes visible when the tree is seen from the bottom. It shows the last node at each horizontal distance from the root.

beginner

How do we assign horizontal distances to nodes in a binary tree for bottom view?

We assign 0 to the root. For left child, horizontal distance is parent's distance minus 1. For right child, it is parent's distance plus 1.

intermediate

Which data structure is commonly used to track nodes and their horizontal distances during bottom view traversal?

A queue is used for level order traversal, and a map (or dictionary) stores the latest node at each horizontal distance.

intermediate

Why does the bottom view use level order traversal instead of in-order or pre-order?

Level order traversal processes nodes level by level, ensuring the bottom-most node at each horizontal distance overwrites previous nodes in the map.

beginner

What is the time complexity of computing the bottom view of a binary tree with n nodes?

The time complexity is O(n) because each node is visited once during level order traversal.

What horizontal distance is assigned to the root node in bottom view calculation?

A Depends on tree height

B 1

C -1

D 0

The root node is always assigned horizontal distance 0.

Which traversal method is best suited for computing the bottom view of a binary tree?

A In-order traversal

B Level order traversal

C Pre-order traversal

D Post-order traversal

Level order traversal visits nodes level by level, which helps track the bottom-most nodes.

In bottom view, what happens if two nodes share the same horizontal distance and level?

A The last node visited is shown

B The first node visited is shown

C Both nodes are shown

D Neither node is shown

The last node visited at that horizontal distance overwrites the previous one in the map.

What data structure helps store the bottom-most node at each horizontal distance?

A Map or dictionary

B Queue

C Stack

D Linked list

A map stores the latest node for each horizontal distance during traversal.

What is the time complexity of the bottom view algorithm for a binary tree with n nodes?

A O(n^2)

B O(n log n)

C O(n)

D O(log n)

Each node is visited once, so the time complexity is O(n).

Explain how to compute the bottom view of a binary tree step-by-step.

Think about horizontal distances and level order traversal.

Why is level order traversal important for the bottom view of a binary tree?

Consider how nodes at the same horizontal distance but different levels are handled.

Practice

1. What does the bottom view of a binary tree represent?

easy

A. Nodes visible when the tree is viewed from the left side

B. Nodes visible when the tree is viewed from the top

C. Nodes visible when the tree is viewed from the bottom

D. Nodes visible when the tree is viewed from the right side

Solution

1. Step 1: Understand the bottom view concept

   The bottom view of a binary tree includes nodes that are visible when looking at the tree from below, meaning the lowest nodes at each horizontal distance.

2. Step 2: Compare with other views

   Top view shows nodes visible from above, left view from left side, right view from right side. Bottom view is distinct as it shows the lowest nodes at each horizontal position.

3. Final Answer:

   Nodes visible when the tree is viewed from the bottom -> Option C

4. Quick Check:

   Bottom view = visible nodes from below [OK]

Hint: Bottom view shows lowest nodes at each horizontal distance [OK]

Common Mistakes:

• Confusing bottom view with top view
• Thinking bottom view shows all leaf nodes
• Mixing bottom view with left or right side views

2. Which TypeScript data structure is best suited to store nodes by their horizontal distance when computing the bottom view?

easy

A. Array

B. Map (key-value pairs)

C. Set

D. Stack

Solution

1. Step 1: Identify the need to map horizontal distances

   We need to associate each horizontal distance with the node visible at that distance in the bottom view.

2. Step 2: Choose a data structure for key-value mapping

   A Map allows storing keys (horizontal distances) with corresponding node values, enabling easy updates and retrieval.

3. Final Answer:

   Map (key-value pairs) -> Option B

4. Quick Check:

   Use Map for horizontal distance to node mapping [OK]

Hint: Use Map to link horizontal distance with nodes [OK]

Common Mistakes:

• Using Array which is index-based, not key-based
• Using Set which stores unique values but no keys
• Using Stack which is LIFO, not suitable for mapping

3. What is the output bottom view of the binary tree represented by the following code?

class Node {
  constructor(public data: number, public left: Node | null = null, public right: Node | null = null) {}
}

const root = new Node(20,
  new Node(8,
    new Node(5),
    new Node(3, null, new Node(10))
  ),
  new Node(22, null, new Node(25))
);

medium

A. [5, 8, 3, 10, 25]

B. [5, 10, 3, 22, 25]

C. [8, 3, 10, 22, 25]

D. [5, 3, 10, 22, 25]

Solution

1. Step 1: Assign horizontal distances and track nodes

   Horizontal distances: 20(0), 8(-1), 22(1), 5(-2), 3(0), 10(1), 25(2). Level order traversal order: 20(0), 8(-1), 22(1), 5(-2), 3(0), 25(2), 10(1). For bottom view, the last node encountered at each hd.

2. Step 2: Determine bottom view nodes by horizontal distance

   hd -2:5; -1:8; 0:3 (overwrites 20); 1:10 (overwrites 22); 2:25. Sorted left-to-right: [5, 8, 3, 10, 25].

3. Final Answer:

   [5, 8, 3, 10, 25] -> Option A

4. Quick Check:

   Bottom view nodes = [5, 8, 3, 10, 25] [OK]

Hint: Track last node at each horizontal distance [OK]

Common Mistakes:

• Choosing first node at horizontal distance instead of last
• Mixing horizontal distances incorrectly
• Ignoring right child nodes at same horizontal distance

4. Identify the bug in this TypeScript code snippet for bottom view of a binary tree:

function bottomView(root: Node | null): number[] {
  if (!root) return [];
  const map = new Map();
  const queue: Array<{node: Node; hd: number}> = [{node: root, hd: 0}];
  while (queue.length) {
    const {node, hd} = queue.shift()!;
    if (!map.has(hd)) {
      map.set(hd, node.data);
    }
    if (node.left) queue.push({node: node.left, hd: hd - 1});
    if (node.right) queue.push({node: node.right, hd: hd + 1});
  }
  return Array.from(map.values());
}

medium

A. It only stores the first node at each horizontal distance, not the bottom-most

B. It uses shift() which is inefficient for queue

C. It does not check if root is null

D. It returns keys instead of values from the map

Solution

1. Step 1: Analyze map update condition

   The code sets map value only if horizontal distance is not present, so it keeps the first node at that distance.

2. Step 2: Understand bottom view requirement

   Bottom view requires the last (bottom-most) node at each horizontal distance, so map should update value every time a node at that hd is found.

3. Final Answer:

   It only stores the first node at each horizontal distance, not the bottom-most -> Option A

4. Quick Check:

   Bottom view needs last node per hd, code stores first [OK]

Hint: Update map value for every node at horizontal distance [OK]

Common Mistakes:

• Not updating map for later nodes at same horizontal distance
• Confusing top view logic with bottom view
• Ignoring null root check (though present here)

5. Given a binary tree where multiple nodes share the same horizontal distance and depth, how should the bottom view algorithm decide which node to display?

hard

A. Display the node with the smallest value at that horizontal distance

B. Display the node with the largest depth but smallest horizontal distance

C. Display the node that appears first in level order traversal at that horizontal distance

D. Display the node that appears last in level order traversal at that horizontal distance

Solution

1. Step 1: Understand node selection criteria for bottom view

   Bottom view shows the lowest node at each horizontal distance. When multiple nodes share horizontal distance and depth, the one encountered last in level order traversal is visible.

2. Step 2: Clarify why last in level order matters

   Level order visits nodes top to bottom, left to right. The last node at a horizontal distance overwrites previous ones, ensuring bottom-most visibility.

3. Final Answer:

   Display the node that appears last in level order traversal at that horizontal distance -> Option D

4. Quick Check:

   Bottom view = last node per hd in level order [OK]

Hint: Choose last node at horizontal distance in level order [OK]

Common Mistakes:

• Choosing node by value instead of position
• Selecting first node instead of last at horizontal distance
• Confusing horizontal distance with depth