Adobe Coding Interview Question - Height of Binary Tree - Leetcode 104

Adobe Coding Interview Question - Height of Binary Tree - Leetcode 104

[ghgftyy]

i interviewed at adobe just a month or two ago and they definitely gave me the hardest questions i’ve had

[OvercookedOmlette]

You can actually pick a node 'a' arbitrary then find the farthest node 'b' from it(dfs), now find the farthest node form 'b', the distance between 'b' and that node is the answer

[simonwillover]

but that uses O(log(n)) memory; obviously you can use O(1) memory instead