class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public class Solution { public int sumNumbers(TreeNode root) { if(root==null)return 0; return sumRoot(root,0); } private int sumRoot(TreeNode root, int sum) { if(…
问题描述: Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. Example: Input: 38 Output: 2 Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it. Follow up:Could…
题目: Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example Given the below binary tree: 1 / \ 2 3 return 6. 题解: Solution 1 () from here class Solution { public: int maxPathSum(TreeNode *root) { if…
Given a binary tree, find the length of the longest consecutive sequence path (连续的路径,不是从小到大). The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path ne…
156. Binary Tree Upside Down Add to List QuestionEditorial Solution My Submissions Total Accepted: 18225 Total Submissions: 43407 Difficulty: Medium Contributors: Admin Given a binary tree where all the right nodes are either leaf nodes with a sibl…
Binary Tree Level Order Traversal Total Accepted: 79463 Total Submissions: 259292 Difficulty: Easy Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3,…
Binary Tree Level Order Traversal II My Submissions QuestionEditorial Solution Total Accepted: 79742 Total Submissions: 234887 Difficulty: Easy Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to ri…
Given a binary tree, find the length of the longest consecutive sequence path. The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from p…
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return…
