摘要：
https://leetcode.com/problems/find-largest-value-in-each-tree-row/ You need to find the largest value in each row of a binary tree. Example: 代码： 今天是不吃 阅读全文
摘要：
https://leetcode.com/problems/binary-tree-preorder-traversal/ Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow 阅读全文
摘要：
https://pintia.cn/problem-sets/994805342720868352/problems/994805432256675840 Eva loves to collect coins from all over the universe, including some ot 阅读全文
摘要：
https://pintia.cn/problem-sets/994805342720868352/problems/994805460652113920 To store English words, one method is to use linked lists and store a wo 阅读全文
摘要：
https://leetcode.com/problems/binary-tree-paths/ Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: 阅读全文
摘要：
https://leetcode.com/problems/minimum-depth-of-binary-tree/ Given a binary tree, find its minimum depth. The minimum depth is the number of nodes alon 阅读全文