Morse Code — Lookup, Learning Ladders & Binary Tree

[!info] How to read · , . = dot (short signal); − , _ = dash (long signal). Read left to right within a code. In the tree, dot branches left, dash branches right. A complete letter requires a boundary (pause) before the next letter which may be indicated by a / or () wrapping of the characters.

1. Complete A–Z lookup

2. Digits 0–9

3. Morse Code Learning Progressions

Learn Morse by recognizing patterns that grow progressively. Each new symbol adds a dot (•) or dash (-) to a familiar sequence.

Pure Dots — E → I → S → H → 5

• E → •• I → ••• S → •••• H → ••••• 5

Pure Dashes — T → M → O → 9 → 0

- T → -- M → --- O → ---- 9 → ----- 0

Dash → Dot Growth — N → D → B → 6

-• N → -•• D → -••• B → -•••• 6

Dot → Dash Growth — A → W → J → 1

•- A → •-- W → •--- J → •---- 1

Dot-Rich Mixed Patterns

••- U · •••- V · ••-• F · •-•• L · •-• R · •--• P

Dash-Rich Mixed Patterns

--• G · --•• Z · --•- Q · -•- K · -•-• C · -•-- Y

Cross Pattern

-••- X

The Numeric Pattern

The digits have a particularly memorable symmetry:

1–5: Increasing dots, decreasing dashes

•---- 1 → ••--- 2 → •••-- 3 → ••••- 4 → ••••• 5

6–0: Increasing dashes, decreasing dots

-•••• 6 → --••• 7 → ---•• 8 → ----• 9 → ----- 0

Memory Shortcuts

• All dots: E → I → S → H → 5
• All dashes: T → M → O → 9 → 0
• Dash followed by growing dots: N → D → B → 6
• Dot followed by growing dashes: A → W → J → 1
• Digits: Five elements each, following a predictable dot-to-dash progression.

Tip: Think of Morse as a branching tree. Every dot moves left, every dash moves right. A letter's Morse code is simply the sequence of branches taken from the root to reach it.

4. Prefix families (the full alphabet in four steps)

Each additional mark descends exactly one level in the Morse tree.

5. Practice: one raw stream, many segmentations

[!warning] Timing is part of Morse In transmitted Morse, gaps within a letter are 1 time unit, between letters 3 units, and between words 7 units. Without those boundaries, decoding can be ambiguous.

6. Recall shortcuts

• E → I → S → H → 5: append one dot each time.
• T → M → O → (prefix) → 0: append one dash each time; ---- is not an assigned basic character.
• N → D → B → 6: one dash followed by increasing dots.
• A → W → J → 1: one dot followed by increasing dashes.
• Digits 1–5: replace dashes with dots from the left (.---- to .....).
• Digits 6–0: replace dots with dashes from the left (-.... to -----).

Learning strategy: recognize the whole pattern, then recognize the family, then rehearse with signal timing.