DSA · Theory

Merkle Tree and Hash Chain Data Structures with a difference

Theory

522/810

Merkle Tree and Hash Chain Data Structures with a difference

Merkle Tree and Hash Chain Data Structures with a difference 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 Merkle Tree and Hash Chain Data Structures with a difference.

From the example next to this theory: Merkle Tree and Hash Chain Data Structures with a difference — hash maps give average O(1) insert/lookup — dict in Python.

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

Viva: what is Merkle Tree and Hash Chain Data Structures with a difference? Then show left < root < right. Then name the trap.

Exam tip

What is Merkle Tree and Hash Chain Data Structures with a difference? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

freq = {}
for ch in "banana":
    freq[ch] = freq.get(ch, 0) + 1
print(freq)
print(freq.get("a"), freq.get("z", 0))

Merkle Tree and Hash Chain Data Structures with a difference — hash maps give average O(1) insert/lookup — dict in Python.

Short notes

DefMerkle Tree and Hash Chain Data Structures with a difference — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

DSA · Theory

Merkle Tree and Hash Chain Data Structures with a difference

← All stacks

Theory

522/810

Merkle Tree and Hash Chain Data Structures with a difference

Merkle Tree and Hash Chain Data Structures with a difference 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 Merkle Tree and Hash Chain Data Structures with a difference.

From the example next to this theory: Merkle Tree and Hash Chain Data Structures with a difference — hash maps give average O(1) insert/lookup — dict in Python.

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

Viva: what is Merkle Tree and Hash Chain Data Structures with a difference? Then show left < root < right. Then name the trap.

Exam tip

What is Merkle Tree and Hash Chain Data Structures with a difference? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

freq = {}
for ch in "banana":
    freq[ch] = freq.get(ch, 0) + 1
print(freq)
print(freq.get("a"), freq.get("z", 0))

Merkle Tree and Hash Chain Data Structures with a difference — hash maps give average O(1) insert/lookup — dict in Python.

Short notes

DefMerkle Tree and Hash Chain Data Structures with a difference — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

Merkle Tree and Hash Chain Data Structures with a difference

Example

Short notes

Questions

Merkle Tree and Hash Chain Data Structures with a difference

Example

Short notes

Questions