CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-04-24 10:32:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents(algo): fix typo and suggestions (#272)

Browse Source
This commit is contained in:
jomosz
2022-05-14 11:02:26 +12:00
committed by GitHub
parent d90f358311
commit 87a923079d
7 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/tree.md
View File

@@ -93,7 +93,7 @@ When a question involves a BST, the interviewer is usually looking for a solutio
| Insert | O(log(n)) |
| Remove | O(log(n)) |
Space complexity of traversing balanced trees is O(n) while traversing very skewed trees (which is essentially a linked list) will be O(n).
Space complexity of traversing balanced trees is O(h) where h is the height of the tree, while traversing very skewed trees (which is essentially a linked list) will be O(n).
## Things to look out for during interviews