# Li Chao Segment Tree Lines: Walkthrough
Li Chao Segment Tree Lines shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store one line per segment-tree node and push the worse line into a child so the envelope of lines can be queried at any x.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log^2 C) per insert or query on a coordinate segment tree.
## Common mistake
Keeping the line that is worse at the midpoint and discarding the one that wins a whole half, which ruins the envelope.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at try it free.