DSA · Theory

Height of n-ary tree if parent array is given

Theory

471/810

Height of n-ary tree if parent array is given

Height of n-ary tree if parent array is given is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Height of n-ary tree if parent array is given.

From the example next to this theory: Height of n-ary tree if parent array is given — arrays give O(1) index access; matrices are arrays of arrays.

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Height of n-ary tree if parent array is given? Then show left < root < right. Then name the trap.

Diagram

  index →  0    1    2
  array → [10,  20,  30]

Exam tip

What is Height of n-ary tree if parent array is given? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

arr = [10, 20, 30, 40]
print(arr[2], arr[-1])
matrix = [[1, 2], [3, 4]]
print(matrix[1][0])  # 3

Height of n-ary tree if parent array is given — arrays give O(1) index access; matrices are arrays of arrays.

Short notes

DefHeight of n-ary tree if parent array is given — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

DSA · Theory

Height of n-ary tree if parent array is given

← All stacks

Theory

471/810

Height of n-ary tree if parent array is given

Height of n-ary tree if parent array is given is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Height of n-ary tree if parent array is given.

From the example next to this theory: Height of n-ary tree if parent array is given — arrays give O(1) index access; matrices are arrays of arrays.

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Height of n-ary tree if parent array is given? Then show left < root < right. Then name the trap.

Diagram

  index →  0    1    2
  array → [10,  20,  30]

Exam tip

What is Height of n-ary tree if parent array is given? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

arr = [10, 20, 30, 40]
print(arr[2], arr[-1])
matrix = [[1, 2], [3, 4]]
print(matrix[1][0])  # 3

Height of n-ary tree if parent array is given — arrays give O(1) index access; matrices are arrays of arrays.

Short notes

DefHeight of n-ary tree if parent array is given — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

Height of n-ary tree if parent array is given

Example

Short notes

Questions

Height of n-ary tree if parent array is given

Example

Short notes

Questions