Home Profile Works Contact

Binary Tree Operations

Explore insertion, searching, deletion, and all three tree traversals.

Total Nodes 0
Root Node None
Tree Height 0

Insert Node

Add one or multiple nodes separated by commas.

Search Node

Find out whether a value exists in the tree.

Delete Node

Remove a node while preserving the BST structure.

Clear Tree

Remove all nodes and start a new tree.

Binary Search Tree Visualization

0 nodes
Your Binary Search Tree is ready.

Your Tree Is Empty

Insert a node to begin building your binary search tree.

Preorder Traversal

Root → Left → Right

Empty

Inorder Traversal

Left → Root → Right

Empty

Postorder Traversal

Left → Right → Root

Empty