题目: Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. For example:Given the following binary tree, 1 <--- / \ 2 3 <--- \ \ 5 4 <--- You should return [1,…

题目: Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example:Given the below binary tree, 1 / \ 2 3 Return 6. 代码: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNod…

题目: 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,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its level order traversal as: [ [3], [9,20], [15,7]…

题目: Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. Note: Recursive solution is trivial, could you do it iteratively? 代码: stack 1: /** * Definition for a bin…

题目: Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6 代码: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *…

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 给定一个二叉树,返回他的层次遍历的节点的values.(提示,从左到右,一层一层的遍历) 例如: 给定一个二叉树 {1,#,2,3}, 1 \ 2 / 3 返回的层次遍历的结果是: [ [3], [9,20], [15,7] ] ++++++++++++++++++++++++++++++++++++++++++++++++++++…

Binary Tree Level Order Traversal 本题收获: 1.vector<vector<int>>的用法 vector<vector<int> >注意<int>后面的空格,vector<vector<int>>表示的是二位向量. 输出格式(后面代码),不知道大小时,在vector中用push_back(vector<int>()) 2.树用迭代 题目: Given a binary tr…

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 给定一个二叉树,寻找值最大的路径. 这个路径可以从这个树上面的任意一个节点开始,然后在任意一个节点结束. 例如: 给定下面的二叉树, 1 / \ 2 3 返回 6. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ G…

[LeetCode]199. Binary Tree Right Side View 解题报告(Python) 标签: LeetCode 题目地址:https://leetcode.com/problems/binary-tree-right-side-view/description/ 题目描述: Given a binary tree, imagine yourself standing on the right side of it, return the values of the no…

Binary Tree Right Side View Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. For example:Given the following binary tree, 1 <--- / \ 2 3 <--- \ \ 5 4 <-…