上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 87 下一页
摘要: https://leetcode.com/problems/binary-tree-level-order-traversal/ Given a binary tree, return the level order traversal of its nodes' values. (ie, from 阅读全文
posted @ 2018-12-17 18:16 丧心病狂工科女 阅读(111) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/binary-tree-right-side-view/ Given a binary tree, imagine yourself standing on the right side of it, return the values o 阅读全文
posted @ 2018-12-17 18:13 丧心病狂工科女 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 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: 代码: 今天是不吃 阅读全文
posted @ 2018-12-14 22:45 丧心病狂工科女 阅读(140) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/binary-tree-preorder-traversal/ Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow 阅读全文
posted @ 2018-12-14 20:49 丧心病狂工科女 阅读(123) 评论(0) 推荐(0) 编辑
摘要: https://pintia.cn/problem-sets/994805342720868352/problems/994805432256675840 Eva loves to collect coins from all over the universe, including some ot 阅读全文
posted @ 2018-12-14 14:12 丧心病狂工科女 阅读(301) 评论(0) 推荐(0) 编辑
摘要: https://pintia.cn/problem-sets/994805342720868352/problems/994805460652113920 To store English words, one method is to use linked lists and store a wo 阅读全文
posted @ 2018-12-14 13:16 丧心病狂工科女 阅读(412) 评论(0) 推荐(0) 编辑
摘要: 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: 阅读全文
posted @ 2018-12-14 10:15 丧心病狂工科女 阅读(101) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2018-12-14 09:37 丧心病狂工科女 阅读(115) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binar 阅读全文
posted @ 2018-12-13 22:13 丧心病狂工科女 阅读(168) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/sum-of-left-leaves/ Find the sum of all left leaves in a given binary tree. Example: 代码: 阅读全文
posted @ 2018-12-13 19:45 丧心病狂工科女 阅读(116) 评论(0) 推荐(0) 编辑
上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 87 下一页