Hacker News new | comments | show | ask | jobs | submit login

Yeah BFS/DFS are O(n) for graphs and trees.



Applications are open for YC Winter 2018

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact

Search: