A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://github.com/syntax-tree/unist/commit/d3957542bd23f5db6cff302a63e39456de7ff17b below:

Refactor diagram to use mermaid · syntax-tree/unist@d395754 · GitHub

File tree Expand file treeCollapse file tree 1 file changed

+6

-16

lines changed

Filter options

Expand file treeCollapse file tree 1 file changed

+6

-16

lines changed 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

You can’t perform that action at this time.


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4