# 0226. Invert Binary Tree ###### tags: `Leetcode` `Easy` `Tree` Link: https://leetcode.com/problems/invert-binary-tree/ ## 思路 ## Code ```java= class Solution { public TreeNode invertTree(TreeNode root) { if(root==null) return null; TreeNode left = invertTree(root.left); TreeNode right = invertTree(root.right); root.left = right; root.right = left; return root; } } ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up