DSA-VerseLearn by watching code run
DashboardData StructuresAlgorithmsVisualizerCORECoding PlaygroundInterview QuestionsComplexity AnalyzerLearning NotesBookmarksLearning ProgressSettings

Algorithms

Explanations, pseudocode, an embedded interactive visualization, implementations in JavaScript, Python, Java and Go, complexity and interview variations.

Tree Algorithms

Binary Tree Inorder Traversal

Interactive

Recursively visits the left subtree, then the node itself, then the right subtree (Left → Root → Right). On a Binary Search Tree this produces the values in sorted order.

O(n) · 4 languages

Preorder Traversal

Planned

Root → Left → Right; used to copy/serialise trees.

O(n)

Postorder Traversal

Planned

Left → Right → Root; used to delete/evaluate trees.

O(n)

Level Order Traversal

Planned

BFS on a tree with a queue, level by level.

O(n)

Tree Height

Planned

1 + max(height(left), height(right)).

O(n)

Lowest Common Ancestor

Planned

Deepest node that has both targets in its subtree.

O(n)