Micro-Drill #61 — Inorder traversal

Tree Traversal Target: 10s

Inorder on a BST yields sorted order. Foundation for validation and kth-smallest.

def inorder(node):
    if not node: return
    inorder(node.left)
    visit(node)
    inorder(node.right)

Type it from memory. Go.