Trees / BST

Non-linear data structures representing hierarchical relationships. Ideal for searching, sorting, and representing nested data.

Traversal Menu

Traversal Output

Logic: Recursion

Pseudocode

Python

1function inorder(node):
2    if node is NULL: return
3    inorder(node.left)
4    visit(node)
5    inorder(node.right)

Select a traversal method.

SearchO(log N)

InsertO(log N)

DeleteO(log N)

WorstO(N)