GoLang Solution For LeetCode Problem: Lowest Common Ancestor of Deepest Leaves
Solving Lowest Common Ancestor of Deepest Leaves in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.
Input: root = [1,2,3] Output: [1,2,3] Explanation: The deepest leaves are the nodes with values 2 and 3. The lowest common ancestor of these leaves is the node with value 1. The answer returned is a TreeNode object (not an array) with serialization "[1,2,3]".
Input: root = [1,2,3,4] Output: 
Input: root = [1,2,3,4,5] Output: [2,4,5]
- The given tree will have between 1 and 1000 nodes.
- Each node of the tree will have a distinct value between 1 and 1000.
See the full details of the problem Lowest Common Ancestor of Deepest Leaves at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go