Binary Search Tree
A binary search tree keeps smaller keys in the left subtree and larger keys in the right subtree, so search follows one branch at a time when the tree is balanced.
이 멘탈 모델부터 시작하세요
A binary search tree keeps smaller keys in the left subtree and larger keys in the right subtree, so search follows one branch at a time when the tree is balanced.
불필요한 전문용어 없이 동작 방식 이해하기
BST order gives efficient search only when tree height stays small.
A plain BST may become a chain and degrade to O(n). Balanced trees fix that risk.
알고리즘을 연속된 의사결정으로 읽기
Identify the invariant that must always remain true.
Follow the read/update path through the structure.
After a mutation, restore the invariant before returning.
Read a tiny input by hand and write down the state after every important operation. For Binary Search Tree, the goal is to make the invariant visible rather than to memorize code.
avg O(log n), worst O(n)
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
적합한 경우
- Choose it when its dominant operations match your workload.
- Compare memory overhead as well as Big-O.
보통 어디에서 문제가 생기는가
- Memorizing complexity without understanding representation.
- Ignoring worst-case shape or resizing/rebalancing costs.
전문적인 답변 구조
Always qualify O(log n) with 'when balanced'. A plain BST has O(n) worst-case search/insert/delete.
What problem does Binary Search Tree solve?
A binary search tree keeps smaller keys in the left subtree and larger keys in the right subtree, so search follows one branch at a time when the tree is balanced.
복잡도에 대해 무엇을 언급해야 하나요?
Its typical cost here is avg O(log n), worst O(n), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
가장 흔한 실수는 무엇인가요?
Memorizing complexity without understanding representation.