Tree

It’s very natural and clear to use the BFS algorithm. Not too complicated, but need to check the details more carefully

Description: https://leetcode.com/problems/find-bottom-left-tree-value/description Notes: BFS Code:

Description: https://leetcode.com/problems/diameter-of-binary-tree/description Notes: Code:

Use the following function to convert the array to treeNode.