Why are union-find operations nearly constant time?

A strong answer

A strong candidate frames Why are union-find operations nearly constant time? around the exact memory layout, compiler semantics, and hardware execution model covered in Union by rank and path compression. Explain union by size, path compression and the inverse Ackermann bound.

The basic union-find from the previous lesson always attaches the second root under the first. Suppose the unions arrive as union(1, 0), union(2, 1), union(3, 2) and so on. Each one attaches the whole existing tree beneath a single new element, and the result is a chain. A find on the deepest element then climbs n − 1 pointers, so a sequence of n finds can cost O(n²). Nothing is wrong with the answers; only the shape is bad. The two fixes below change only the shape.

When merging two trees, attach the smaller tree under the root of the larger one. Keep a size array alongside parent, updated when a union succeeds:

In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.

What the interviewer is listening for

• Mastery of core invariant: Keep union-find trees shallow with union by size or rank, and explain the log n height bound.
• Mastery of core invariant: Implement path compression, and path halving as a one-pass alternative.
• Mastery of core invariant: Explain what the inverse Ackermann bound means in practice.
• Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
• Defensive engineering: Naming the exact compiler flags (-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.

Common mistakes

• Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
• Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.