Refactor diagram to use mermaid · syntax-tree/unist@d395754 (original) (raw)

| Original file line number | Diff line number | Diff line change | | | | | | | | | ---------------------------------------------------------------------------------------------- | ---------------- | ----------------------------------------------------- | | - | | - | | - | | | @@ -349,22 +349,12 @@ Tree traversal is typically either *breadth-first* or *depth-first*. | | | | | | | | | | | 349 | 349 | | | | | | | | | | 350 | 350 | In the following examples, we’ll work with this tree: | | | | | | | | | 351 | 351 | | | | | | | | | | 352 | | -```ascii | | | | | | | | | 353 | | - +---+ | | | | | | | | | 354 | | - | A | | | | | | | | | 355 | | - +-+-+ | | | | | | | | | 356 | | - | | | | | | | | | | 357 | | - +-----+-----+ | | | | | | | | | 358 | | - | | | | | | | | | | 359 | | - +-+-+ +-+-+ | | | | | | | | | 360 | | - | B | | F | | | | | | | 361 | | - +-+-+ +-+-+ | | | | | | | | | 362 | | - | | | | | | | | | | 363 | | - +-----+--+--+ | | | | | | | | | | 364 | | - | | | | | | | | | | 365 | | - +-+-+ +-+-+ +-+-+ +-+-+ | | | | | | | | | 366 | | - | C | | D | | E | | G | | | 367 | | - +---+ +---+ +---+ +---+ | | | | | | | | | | 352 | +```mermaid | | | | | | | | | | | 353 | +graph TD | | | | | | | | | | | 354 | + A-->B-->C | | | | | | | | | | | 355 | + B-->D | | | | | | | | | | | 356 | + B-->E | | | | | | | | | | | 357 | + A-->F-->G | | | | | | | | | | 368 | 358 | ``` | | | | | | | | | 369 | 359 | | | | | | | | | | 370 | 360 | ###### Breadth-first traversal | | | | | | | |