Skip to content

Commit

Permalink
Refactor diagram to use mermaid
Browse files Browse the repository at this point in the history
Closes GH-74.

Reviewed-by: Titus Wormer <[email protected]>
  • Loading branch information
thiskevinwang committed Jul 28, 2022
1 parent 26f0395 commit d395754
Showing 1 changed file with 6 additions and 16 deletions.
22 changes: 6 additions & 16 deletions readme.md
Original file line number Diff line number Diff line change
Expand Up @@ -349,22 +349,12 @@ Tree traversal is typically either *breadth-first* or *depth-first*.

In the following examples, we’ll work with this tree:

```ascii
+---+
| A |
+-+-+
|
+-----+-----+
| |
+-+-+ +-+-+
| B | | F |
+-+-+ +-+-+
| |
+-----+--+--+ |
| | | |
+-+-+ +-+-+ +-+-+ +-+-+
| C | | D | | E | | G |
+---+ +---+ +---+ +---+
```mermaid
graph TD
A-->B-->C
B-->D
B-->E
A-->F-->G
```

###### Breadth-first traversal
Expand Down

0 comments on commit d395754

Please sign in to comment.