摘要：
Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] Follow up: Recursive s 阅读全文
posted @ 2020-03-08 11:05
米开朗菠萝
阅读(91)
评论(0)
推荐(0)
摘要：
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
posted @ 2020-03-08 10:53
米开朗菠萝
阅读(127)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no children. Exampl 阅读全文
posted @ 2020-03-08 10:35
米开朗菠萝
阅读(125)
评论(0)
推荐(0)
浙公网安备 33010602011771号