AlgoVista

Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Linear Search
Binary Search
Jump Search
BST Insert
BST Search
In-order Traversal

Breadth-First Search
Depth-First Search
Dijkstra's Shortest Path
Prim's MST
Kruskal's MST
Topological Sort (Kahn's)
Tower of Hanoi
N-Queens
Permutations (Backtracking)
Fibonacci (DP)
0/1 Knapsack
Longest Common Subsequence
Coin Change (Min Coins)

Hill Climbing
Simulated Annealing
Differential Evolution

Q-Learning

Genetic Algorithm
Particle Swarm Optimization
Ant Colony Optimization

Monte Carlo Simulation

Placeholder — future integration.

"The invisible architecture through which intelligence becomes impact."

01Foundations·Ordered Insertion

BST Insert

⏱ O(h)◧ O(h)

Step 1 / 35

Speed

01Foundations

BST Insert

Ordered Insertion

Place each key on the side its comparison dictates.

Time

O(h)

Space

O(h)

Applications

Ordered maps
Range queries
In-memory indexing

Reasoning Trace

Insert 50

inserting50

Principle in Pseudocode

1walk from root
2go left if v < node else right
3insert at first empty spot

Reference implementation · python

def insert(node, v):
  if node is None: return Node(v)
  if v < node.v: node.left = insert(node.left, v)
  else: node.right = insert(node.right, v)
  return node