LeetCode-Invert Binary Tree
Posted IncredibleThings
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode-Invert Binary Tree相关的知识,希望对你有一定的参考价值。
Invert a binary tree. 4 / 2 7 / \ / 1 3 6 9 to 4 / 7 2 / \ / 9 6 3 1
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode invertTree(TreeNode root) { if(root==null){ return null; } if(root.left==null && root.right==null){ return root; } TreeNode temp=root.left; root.left=invertTree(root.right); root.right=invertTree(temp); return root; } }
以上是关于LeetCode-Invert Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 103. Binary Tree Zigzag Level Order Traversal
#Leetcode# 103. Binary Tree Zigzag Level Order Traversal
[Leetcode] Recover Binary Search Tree