I’m trying to get a feel for what sort of interview questions regarding binary trees have a >=25% chance of coming up. I get the feeling that it’s a diminishing returns problem where if you know *everything* about binary trees, you’re underprepared elsewhere. Here’s my notional >=25% list - tree traversals - Max depth - is balanced - min Val - max value And my <25% list - insertions - deletions - AVL trees - R/B trees Does this sound about right?
How are you at Meta and can't recall solution to all common tree problems even when woken abruptly at 2 am? Non-SWE role? Also, add vertical order traversal.
I don't think the interviews are long enough to have you do any real R/B or AVL implementations. Good to know so you can talk about. Traversals are basically guaranteed to show up, don't forget level order (from root or leaf) though.
hang on a sec. it’s absolutely trivial to know everything about binary trees. you are nowhere near diminishing returns yet, at that point. level up
There is no way they need to know about AVL or R/B.
you don’t need to be expert at it. you would never be asked to implement. but you damn well better know the theory. this is 101 stuff
India
16h
741
Why Worshipping Lord Ram Important in Hinduism?
Tech Industry
10h
1228
Racism towards Indians
New York
15h
885
Real talk: in what way private schools are better than public in nyc?
Tech Industry
3d
34401
LLM limits exposed
World Conflicts
5h
242
Israel prevents Palestinians from gathering rainwater? Seems wrong on so many levels to me
Use leetcode premium and sort by decreasing frequency. No need to do so much research.
Damn this guy knows how to grind better than my IoT coffee grinder!
This is the tip of the iceberg my friend. Best of luck.