From 1a19b82290f0b8a22f09e615c623db2dbe521cd7 Mon Sep 17 00:00:00 2001 From: Kevin Wang Date: Thu, 28 Jul 2022 11:05:01 -0400 Subject: [PATCH] Use mermaid for Tree diagram --- readme.md | 22 ++++++---------------- 1 file changed, 6 insertions(+), 16 deletions(-) diff --git a/readme.md b/readme.md index 5faff83..6d60400 100644 --- a/readme.md +++ b/readme.md @@ -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