A valid 6-node binary search tree with a single labeled in-order traversal.
This is a live preview — pan and zoom to explore the diagram. Open it in the full editor below to edit, export, or share it.
When to use this Excalidraw example
Use it to explain tree structure, BST invariants, or walk through one traversal (in-order, pre-order, or level-order) without competing overlays.
Open this example in the full Excalidraw editorMake it your own
The example opens as a local drawing in the editor. Move or rename shapes, add arrows and notes, export PNG or SVG, or use the Share button to copy a compressed URL containing the current scene.
