Isn't this problem the same as 865 Smallest Subtree with all the deepest nodes? - Lowest Common Ancestor of Deepest Leaves - LeetCode

Editorial

Solutions (856)

All

CC++JavaPythonPython3JavaScriptSwiftRubyGoC#RustTypeScriptScalaKotlinElixirDepth-First SearchRecursionBreadth-First SearchBinary TreeTreeQueueHeap (Priority Queue)IteratorHash TableDynamic ProgrammingStackBinary Search TreeDivide and ConquerGraphMemoizationSimulation