Binary tree examples.
Same tool, four requests. Every drawing below is a real render.
Rather start from a finished drawing? Browse 111 org chart templates →
What a binary tree is.
A binary tree is a tree data structure in which each node has at most two children: a left child and a right child. The meaning of those children depends on the application.
In a binary search tree, left values are smaller and right values are larger. In an expression tree, internal nodes are operators and leaves are operands. The same branching shape supports many algorithms.
- Standard
- Reingold-Tilford tidy tree
- Engine
- schematex-orgchart
- Editable
- Double-click text, drag nodes
- Export
- SVG · PNG · PDF
Who uses binary trees.
Small trees for learning insertion, traversal and recursive algorithms.
Expression trees that show how parsers preserve grouping and precedence.
Two-way decision paths for basic troubleshooting.
How to make a binary tree in three steps.
Describe it
One paragraph is enough to start.
See the drawing
Drawn by the right engine.
Say what changes
Every edit keeps a version.
Common questions
What is a binary tree?
A binary tree is a tree where each node has no more than two children, conventionally called left and right.
What is a binary search tree?
A BST is a binary tree where every left-subtree value is smaller and every right-subtree value is larger than its node.
Does insertion order affect a BST?
Yes. Different insertion orders can produce different valid shapes from the same values.
What are tree traversals?
Traversals are orders for visiting nodes, including preorder, inorder and postorder.
Other drawings for the same work.
Create a binary tree now.
Free account, no card. Describe the structure and see it in under a minute.
Open the editor