Invert a binary tree.
no example
交换左右子树
public TreeNode invertTree(TreeNode root) {
if (root != null) {
TreeNode left = root.left;
TreeNode right = root.right;
root.left = right;
root.right = left;
invertTree(left);
invertTree(right);
}
return root;
}
思路：老老实实换呗。
D59 226. Invert Binary Tree 题目链接 226. Invert Binary Tree ...
226. Invert Binary Tree Invert a binary tree. Example: In...
104. Maximum Depth of Binary Tree226. Invert Binary Tree ...
Algorithm：Leetcode 226 Invert-binary-tree Review：what-is-...
226. Invert Binary Tree 题目:https://leetcode.com/problems/...
//226 Invert a binary tree4/ 2 7/ \ / 1 3 6 9...
LeetCode:226 invert-binary-tree先序遍历： 中序遍历： 后序遍历： 层序遍历：
Invert a binary tree. 4/ 2 7/ \ / 1 3 6 9 to ...
Invert a binary tree. Example： no example 解释下题目： 交换左右子树 1...
226. Invert Binary Tree [思路]：讲一个数左右子树互换； 使用深度遍历；
本文标题：226 Invert Binary Tree
本文链接：https://www.haomeiwen.com/subject/hysaeqtx.html
网友评论