Leetcode | 513. Find Bottom Left Tree Value

题目：翻转二叉树

方法①：深度优先遍历(链接)

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:TreeNode * invertTree(TreeNode* root){if (!root)return root;DFS(root, root->left, root->right);return root;}void DFS(TreeNode *root, TreeNode *p1, TreeNode *p2){if (!p1 && !p2)return;TreeNode *s = root->left;root->left = root->right;root->right = s;if (p1)DFS(p1, p1->left, p1->right);if (p2)DFS(p2, p2->left, p2->right);}
};

Leetcode | 513. Find Bottom Left Tree Value相关推荐

LeetCode 513. Find Bottom Left Tree Value
513. Find Bottom Left Tree Value Given a binary tree, find the leftmost value in the last row of the ...
[LeetCode] 513. Find Bottom Left Tree Value_ Medium tag: BFS
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input:2/ \1 3Ou ...
513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input:2/ \1 3Ou ...
【LeetCode】513. Find Bottom Left Tree Value
问题描述问题链接:https://leetcode.com/problems/find-bottom-left-tree-value/#/description Given a binary tre ...
Java描述 LeetCode，513. Find Bottom Left Tree Value 找左下角的值
大家好,我是河海哥,专注于后端,如果可以的话,想做一名code designer而不是普通的coder,一起见证河海哥的成长,您的评论与赞是我的最大动力,如有错误还请不吝赐教,万分感谢.一起支持原创吧 ...
leetcode讲解--513. Find Bottom Left Tree Value
题目 Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input:2/ \1 ...
【Breadth-first Search 】513. Find Bottom Left Tree Value
输入:一颗二叉树输出:这颗树的最下面一层最左边的节点值. 分析: 用BFS的思路解决最直观.读每一层,在每一层记录第一个元素的值.在队列中第一层:1:第二层:2,3:第三层 4,5,6.如此继续下去 ...
LeetCode 545. Boundary of Binary Tree 二叉树边界
LeetCode 545. Boundary of Binary Tree 二叉树边界 Given a binary tree, return the values of its boundary i ...
LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree
LeetCode:Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth ...

Leetcode | 513. Find Bottom Left Tree Value

题目：翻转二叉树

Leetcode | 513. Find Bottom Left Tree Value相关推荐

最新文章

热门文章