Sorted_binary_tree_ALL_RGB.svg
Size of this PNG preview of this SVG file:
348 × 297 pixels
.
Other resolutions:
281 × 240 pixels
|
563 × 480 pixels
|
900 × 768 pixels
|
1,200 × 1,024 pixels
|
2,400 × 2,048 pixels
.
Summary
| Description |
English:
Traversal of an ordered binary tree with keys A,B,C,D,E,F,G,H,I. (3 nodes with 2 children, 1 node with 1 left, 1 node with 1 right, and 4 nodes without child.) Access to node in preorder position only (red,
) yields the sequence F-B-A-D-C-E-G-I-H; in inorder position only (green,
) yields the sequence A-B-C-D-E-F-G-H-I; in postorder position only (blue,
) yields the sequence A-C-E-D-B-H-I-G-F.
|
| Date | |
| Source | |
| Author | user:Nomen4Omen |
| Other versions | File:Sorted binary tree ALL.svg |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
|
I, the copyright holder of this work, release this work into the
public domain
. This applies worldwide.
In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose , without any conditions, unless such conditions are required by law. |