Trees that balance themselves
Circle a tree with the Magic pen and ask for an insert. It’s rebalanced, every balance factor shown.
Algorithms traced by hand
Ask the Magic pen to trace Dijkstra on your graph. Every step’s distances are written out.
Big-O from the recursion tree
Hold Talk and ask about a recurrence. The tree is drawn, each level’s cost added up.
Automata by voice
Ask Talk for a DFA. Its states, transitions and accepting state are drawn in.
