# Linked List In Binary Tree: Study Guide

Linked List In Binary Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

For each tree node try to match the list downward; or use KMP on the list while doing DFS.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n*m) naive, O(n+m) with KMP.

## Common mistake

Restarting the match from the list head at the wrong node.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.