Morse Code Tree: How to Decode Dots and Dashes Visually

A Morse code tree is a branching diagram that turns a string of dots and dashes into a letter without searching a chart. Start at the top, move down to the left for every dot and down to the right for every dash, and the node where the letter ends is your answer. One dot lands on E, one dash lands on T, and four steps are enough to reach all 26 letters.

Try it below: press Dot and Dash to walk the branches, click any letter to see its path, or type a letter such as K (or a code such as -.-) and press Trace to watch the route light up.

How the Morse code tree works

The tree is built from one rule applied again and again. Every letter in International Morse code is a short sequence of two element types, so every step down the tree is a choice between two branches.

1. Start at the top. The start node holds no letter. It means “nothing received yet”.
2. A dot moves you down and to the left. One dot from the start reaches E.
3. A dash moves you down and to the right. One dash from the start reaches T.
4. Each further element moves you one level lower, left for a dot and right for a dash, from wherever you are now.
5. When the letter ends, read the node you are standing on. In sound, the end of a letter is the gap of three units; on paper, it is the space between groups. Then go back to the start for the next letter.

The depth of a node always equals the number of elements in its code. E and T are one element deep, A and N two, K and O three, and Q and Y four. That is why short, common letters cluster near the top and long ones sit along the bottom row.

Direction carries the whole meaning. The path to K is dash, dot, dash, so you go right, then left, then right: -.-. The path to R is the mirror image, dot, dash, dot, and it ends on the opposite side of the tree: .-..

The Morse tree level by level

This compact table is the tree written out row by row, left to right. Reading along a row gives you the letters in the same order the diagram draws them.

A few patterns in this table make the tree easier to picture:

• The left edge is all dots. E, I, S, H run straight down the left side, and the next step, five dots, is the digit 5.
• The right edge is all dashes. T, M, O run down the right side. The four-dash position below O is empty in the English alphabet, and five dashes is the digit 0.
• Every node splits into a dot child on its left and a dash child on its right. Below A (dot dash) you find R (dot dash dot) and W (dot dash dash). Below N you find D and K.
• Levels double. One, then 2, 4, 8 and 16 positions. Levels one to four give 30 positions for 26 letters.

The four empty nodes at level four

Four of the sixteen four-element codes have no English letter. In tree order they are dot dot dash dash, dot dash dot dash, dash dash dash dot and dash dash dash dash. The International Morse code in ITU-R M.1677-1 lists the letters a to z plus one accented e, so it assigns nothing to those four positions.

Other languages fill some of them. In several European alphabets the codes are used for Ü ..--, Ä .-.- and Ö ---., and four dashes has been used for CH. Our tree leaves the four nodes blank, and clicking one tells you there is no letter there. If you decode a message and land on an empty node, the most likely explanation is a missed letter gap or an extra element, not a hidden letter.

Digits and punctuation sit deeper

Every digit has five elements, so all ten sit on level five. The number 5 is five dots at the far left, ....., and 0 is five dashes at the far right, -----. Most punctuation needs six elements: the full stop is .-.-.- and the question mark is ..--...

A tree that showed all of that would have 32 positions on level five and 64 on level six, most of them empty and too small to read. That is why most drawings, including the one on this page, stop at level four. For the numbers and symbols themselves, use the flat alphabet chart on our translator page.

How to decode Morse code with the tree: worked examples

Decoding is the job the tree was designed for. You never need to know where a letter is in advance; you only need to follow the elements in order. Each example below shows the sequence first, then the walk.

Example 1: a single letter

Take -.-.

1. Start at the top.
2. Dash: go right to T.
3. Dot: go left from T to N.
4. Dash: go right from N to K.
5. The letter ends, so the answer is K.

Notice that you passed through T and N on the way. Every letter’s path runs through the letters whose codes begin the same way, which is why stopping one step early gives a different, shorter letter.

Example 2: the word TREE

The word TREE is sent as - .-. . .. Treat each group between spaces as a fresh trip from the start.

The second group shows the most useful habit on the tree: say the direction out loud as you move. “Left, right, left” is quicker to follow than counting dots.

Example 3: the word CODE

CODE is -.-. --- -.. ..

• C: right to T, left to N, right to K, left to C. Four elements, so C is on the bottom row.
• O: right, right, right. Three dashes run straight down the right edge to O.
• D: right to T, left to N, left to D.
• E: one step left.

Example 4: what a missed letter gap does

Spacing matters as much as the elements. Suppose a dash and a dot are meant as two letters, T then E, written - .. If the gap between them is lost, the tree reads one continuous path, right then left, and stops at N, -.. In the same way, . - run together lands on A, .-.

The tree cannot detect this for you. It only reports where the path ends, which is why the letter gap in the timing rules is the signal to go back to the start.

Encoding with the tree: follow the path in reverse

You can also use the tree to find the code for a letter you want to send. The method is the reverse of decoding.

1. Find the letter on the diagram. Level one to four, left or right half.
2. Climb from the letter back up to the start, noting each branch you climb.
3. Reverse that list. The first branch below the start is the first element.
4. Convert directions to elements: a branch that leans left is a dot, a branch that leans right is a dash.

Worked example for Q. Q sits on the bottom row, towards the right. Climbing up: Q hangs to the right of G, G to the left of M, M to the right of T, and T to the right of the start. Reading from the top down gives right, right, left, right: dash, dash, dot, dash, --.-.

Worked example for Y. Y is on the bottom row just left of Z. Climbing up: Y is the right child of K, K the right child of N, N the left child of T, T the right child of the start. Top down: right, left, right, right, so dash, dot, dash, dash, -.--.

In the widget above, typing a letter and pressing Trace animates exactly this path from the top down, so you can check your reverse walk.

Encoding by tree is slower than decoding by tree, because you first have to find the letter. For writing out a whole message, typing it into our Morse Code Translator is faster and removes the risk of a slip.

Mirrored trees and other layouts

There is no standard orientation for the Morse tree. Most modern diagrams and programming examples use dot left and dash right, the same as the widget here. Some printed charts, such as the long-circulated KB3BYT decoding tree, mirror it and send a dit down to the right and a dah down to the left.

Both versions decode correctly. The risk comes from mixing them, for example learning on one and practising on a printout of the other. Before using any tree, check which way its first branch goes: whichever side holds E is the dot side.

You will also see trees drawn from left to right instead of top to bottom, or folded into a circle with only horizontal and vertical lines. The layout changes; the parent and child relationships do not. E is always the dot child of the start, and K is always the dash child of N.

Why the tree helps visual learners

The tree gives every letter a place. Instead of 26 unrelated rows in a chart, you see families: everything under E starts with a dot, everything under T starts with a dash, and S, H and 5 are simply “more dots” below I. Many learners find that structure easier to hold in mind than a list.

It also makes relationships obvious that a chart hides:

• Letters that differ only in their last element are neighbours. S and U share a parent, as do D and K, and G and O.
• Opposite letters sit in mirror positions. Swap every dot for a dash and you land in the mirror-image spot on the other half of the tree: A and N, U and G, D and W, R and K, S and O.
• Reversed letters are easy to confuse. U and D, and W and G, use the same elements in the opposite order (..- and -..), yet they sit far apart on the tree. Keep these pairs in mind when a decoded word looks almost right.
• A path that stops early is still a letter. Every prefix of a letter’s code is itself a letter, as long as you stay within the top four levels, so a lost element usually produces a real but wrong letter.

As a memory aid, the tree works best alongside other tricks rather than as the only one. The Morse code mnemonics guide covers word rhythms and picture methods, and what each costs you later.

Strengths and limitations of the Morse code tree

The tree is a good decoding tool on paper and a poor one at listening speed. Both sides are worth knowing before you build a habit around it.

Strengths

• No searching. You follow the elements; the letter finds you.
• Self-checking structure. Landing on an empty node is an instant sign that something was misread.
• Shows why short codes go to common letters. E, T, A, I, N and S all sit within two or three steps of the start.
• Useful for puzzles and written Morse. Escape rooms, geocaches and printed messages give you unlimited time, which suits tracing.

Limitations

• It is slow for real copying. Each element needs a separate move. At normal sending speeds the next letter starts before you have finished tracing the last one.
• It encourages counting. Tracing trains you to hear a letter as a list of dots and dashes. The ARRL advises learning each character by the way it sounds rather than as dots and dashes. Turning a sound into a path and then into a letter is an extra step that listening at speed does not leave time for.
• Digits and punctuation are out of reach. They sit on levels five and six, which most trees do not draw.
• Mirrored versions exist. A printout from a different source can reverse every direction you learned.
• It does nothing for sending. The tree tells you where a letter is, not how its rhythm should sound on a key.

If your aim is to copy Morse by ear, the tree is a stepping stone at most. The guide to decoding Morse code by ear explains how to hear whole letters, and the Koch method plan teaches characters as sounds from the first lesson.

Morse tree vs alphabet chart

Both show the same codes. They are organised for different jobs.

In short: use the tree to read, the chart to write, and neither when you are listening at speed.

The tree and binary trees

In computing terms, the letter part of the Morse tree is a binary tree: every node has at most two children, one for a dot and one for a dash, and depth equals code length. That is why it appears in programming courses as a decoding exercise.

The comparison has a limit. The tree only works because a letter gap tells you where one letter stops, since a short code such as E is also the start of longer codes such as A and I. Whether that makes Morse itself a binary code is a separate question, answered in Is Morse code binary?.

Practice exercises with the interactive tree

Use the widget at the top of this page for these drills. Keep the sound on so every letter you reach is also played.

1. Edges first. Press Dot four times, then Reset and press Dash three times. Say each letter aloud: E, I, S, H, then T, M, O.
2. Mirror pairs. Trace A, then N. Then U and G, then R and K. Each pair lands in mirror-image spots on opposite halves, because every dot in one is a dash in the other.
3. Decode five words on paper, then check them. Work out -- .- .--., .... .- -, ..-. --- -..-, .--. .- .-. -.- and -. .. -.-. .. Type each letter code into the Trace box to confirm it.
4. Reverse-path encoding. Without looking at any chart, write the code for B, V, X and J by finding each on the tree and climbing up. Check with Trace.
5. Find the empty nodes. Click the four blank circles on the bottom row and write down the path to each. You should find two on the left half and two on the right.
6. Tree-free recall. Cover the diagram with your hand, press the Dot and Dash buttons to spell a letter you have in mind, and see whether the readout agrees. When it does every time, you know the shape without the picture.

Once you can name the top three levels without looking, stop tracing and start listening. Play a letter, name it from its sound, and use the tree only to check a miss.