Solving Find Bottom Left Tree Value in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a binary tree, find the leftmost value in the last row of the tree.

Example 1:

Input:

    2
   / \
  1   3

Output:
1

Example 2:

Input:

        1
       / \
      2   3
     /   / \
    4   5   6
       /
      7

Output:
7

See the full details of the problem Find Bottom Left Tree Value at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go