leetcode分类-leetcode-summary-golang:leetcode总结——golang实现

# leetcode-summary-golang Algorithm problem classification in leetcode by [huahua LeetCode](https://docs.google.com/spreadsheets/d/1SbpY-04Cz8EWw3A_LBUmDEXKUMO31DBjfeMoA0dlfIA/edit#gid=0) ## Tree | Id | Name | Level | Similar Problems | Comments | | ---: | --- | :---: | :---- | ---- | | 94 | [Binary Tree Inorder Traversal](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_1/94_Binary_Tree_Inorder_Traversal.md) | ★ | [589](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_1/589_N-ary_Tree_Preorder_Traversal.md), [590](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_1/590_N-ary_Tree_Postorder_Traversal.md) | traversal | | 100 | [Same Tree](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/100_Same_Tree.md) | ★★ | [101](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/101_Symmetric_Tree.md), [104](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/104_Maximum_Depth_of_Binary_Tree.md), [110](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/110_Balanced_Binary_Tree.md), [111](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/111_Minimum_Depth_of_Binary_Tree.md), [572](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/572_Subtree_of_Another_Tree.md), [965](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/100_Same_Tree/965_Univalued_Binary_Tree.md) | | | 102 | [Binary Tree Level Order Traversal](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/102_Binary_Tree_Level_Order_Traversal/102_Binary_Tree_Level_Order_Traversal.md) | ★★ | [107](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/102_Binary_Tree_Level_Order_Traversal/107_Binary_Tree_Level_Order_Traversal_II.md), [429](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/102_Binary_Tree_Level_Order_Traversal/429_N-ary_Tree_Level_Order_Traversal.md), [872](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/102_Binary_Tree_Level_Order_Traversal/872_Leaf-Similar_Trees.md), [987](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/102_Binary_Tree_Level_Order_Traversal/987_Vertical_Order_Traversal_of_a_Binary_Tree.md) | collecting nodes | | 814 | [Binary Tree Pruning](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/814_Binary_Tree_Pruning/814_Binary_Tree_Pruning.md) | ★★ | [669](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_2/814_Binary_Tree_Pruning/669_Trim_a_Binary_Search_Tree.md) | | | 112 | [Path Sum](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/112_Path_Sum/112_Path_Sum.md) | ★★★ | [113](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/112_Path_Sum/113_Path_Sum_II.md), [437](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/112_Path_Sum/437_Path_Sum_III.md) | | | 124 | [Binary Tree Maximum Path Sum](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/124_Binary_Tree_Maximum_Path_Sum/124_Binary_Tree_Maximum_Path_Sum.md) | ★★★ | [543](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/124_Binary_Tree_Maximum_Path_Sum/543_Diameter_of_Binary_Tree.md), [687](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/124_Binary_Tree_Maximum_Path_Sum/687_Longest_Univalue_Path.md) | Use both children, return one | | 129 | [Sum Root to Leaf Numbers](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/129_Sum_Root_to_Leaf_Numbers/129_Sum_Root_to_Leaf_Numbers.md) | ★★★ | [257](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/129_Sum_Root_to_Leaf_Numbers/257_Binary_Tree_Paths.md) | | | 236 | [Lowest Common Ancestor of a Binary Tree](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/236_Lowest_Common_Ancestor_of_a_Binary_Tree/236_Lowest_Common_Ancestor_of_a_Binary_Tree.md) | ★★★ | [235](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/236_Lowest_Common_Ancestor_of_a_Binary_Tree/235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree.md) | | | 297 | [Serialize and Deserialize Binary Tree](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/297_Serialize_and_Deserialize_Binary_Tree/297_Serialize_and_Deserialize_Binary_Tree.md) | ★★★ | [449](https://github.com/DinghaoLI/leetcode-summary-golang/blob/master/Tree/level_3/297_Serialize_and_Deserialize_Binary_Tree/449_Serialize_and_Deserialize_BST.md) | |