Просмотр кода страницы Обсуждение:Binary search (diagram)

== Диаграммы бинарного поиска Mermaid1  ==

{{#mermaid:flowchart LR
   A["A"] --- T1( )
    T1---B[B] 
    T1---C[C]
    T1---D[D]
}}

== Binary Tree ==

{{#mermaid:graph TB
    A((1))-->B((2))
    A-->C((3))
    B-->D((4))
    B-->E((5))
    C-->F((6))
    C-->G((7))
    D-->H((8))
    D-->I((9))
    F-->J((10))
    F-->K((11))
}}

==  Perfect Binary Tree ==
см. https://jojozhuang.github.io/tutorial/creating-data-structure-diagrams-with-mermaid/

{{#mermaid:graph TB
    A((1))-->B((2))
    A-->C((3))
    B-->D((4))
    B-->E((5))
    C-->F((6))
    C-->G((7))
    D-->H((8))
    D-->I((9))
    E-->J((10))
    E-->K((11))
    F-->L((12))
    F-->M((13))
    G-->N((14))
    G-->O((15))
}}


=== В числах ===
{{#mermaid:graph TB
    1 --> 2
    1 --> 3
    2 --> 4
    2 --> 5
    3 --> 6
    3 --> 7
    4 --> 8
    4 --> 9
    5 --> 10
    5 --> 11
    6 --> 12
    6 --> 13
    7 --> 14
    7 --> 15
}}