# Leetcode 513 - Find bottom left tree value

`Note:`

`Level order traversal`

makes this question quite easier.

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

**Example**

1 | Input: root = [2,1,3] |

1 | /** |

`Note:`

`Level order traversal`

makes this question quite easier.

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

**Example**

1 | Input: root = [2,1,3] |

1 | /** |