* Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassSolution{publicTreeNodeinvertTree(TreeNode root){if(root==null){// 节点为空,不处理returnnull;}else{// 节点不为空Tree...
代码: /*** Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * }*/publicclassSolution {publicTreeNode invertTree(TreeNode root) {if(root==null)returnnull; exchange(root);returnroot; }pub...
root.left = invertTree(root.left); root.right = invertTree(root.right);returnroot; } 03 第二种解法 此解法比上面的第一种解法精简了些,直接将上面核心代码进行套用,将root的左子节点取出存入tmp,再将root的左子节点指向递归后的root的右子节点,再将root的右子节点指向递归后的tmp,最后返回root即可。 p...
JAVA在学者 LeetCode 226 Invert Binary Tree 层序遍历方法 package com.example.demo; import java.util.LinkedList; import java.util.Queue; /** * Created By poplar on 2019/10/30 */ public class InvertBinaryTree { public static void main(String[] args) { TreeNode node = new TreeNode(1); ...
226. Invert Binary Tree leetcode-java文章分类运维 Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 1. 2. 3. 4. 5. to 4 / \ 7 2 / \ / \ 9 6 3 1 1. 2. 3. 4. 5. Trivia: This problem was inspired by this original tweet by Max Howell:...
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 1. 2. 3. 4. 5. to 4 / \ 7 2 / \ / \ 9 6 3 1 1. 2. 3. 4. 5. 题解: 既可以自顶向下,也可以自底向上. Time Complexity: O(n). Space: O(logn). AC Java: ...
文章目录 [226. 翻转二叉树](https://leetcode-cn.com/problems/invert-binary-tree/) 广度优先遍历深度优先遍历 难度简单743 翻转一棵二叉树。示例:输入: 4 / \ 2 7 / \ / \ 1 3 6 9 输出: 4 / \ 7 2 / \ / \ 9 6 3 1 广度优先遍历 public TreeNode invertTree(T Java架构师必看 2021...
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off. Java /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) ...
Java: // Runtime: 238 ms/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassSolution{publicTreeNodeinvertTree(TreeNode root){if(root !=null){TreeNodetemp=root.lef...
(Java) Version 1 Time: 1ms: 简单地递归然后调换左右子树 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassSolution{publicTreeNodeinvertTree(TreeNoderoot){if(root==...