← Return

🌳 Binary tree visualization

Inserting, deleting, and traversing a binary search tree

Operation
Quick build
Traverse
Traversal results
-
Tree information
Number of nodes 0
tree height 0
Minimum value -
Maximum value -
Binary search tree properties

Binary Search Tree (BST) is a special binary tree:

• The values of all nodes in the left subtree < the value of the root node

• The values of all nodes in the right subtree > the value of the root node

• The left and right subtrees are also binary search trees


Traversal method:

• Preorder: root → left → right

• Middle order: left → root → right (ascending output)

• Sequence: left → right → root

• Layer sequence: layer by layer from left to right