码迷,mamicode.com
首页 > 其他好文 > 详细

226反转二叉树 Invert Binary Tree

时间:2017-01-10 23:47:58      阅读:87      评论:0      收藏:0      [点我收藏+]

标签:ica   size   mono   weight   bsp   public   20px   amp   div   


Invert a binary tree.

     4
   /     2     7
 / \   / 1   3 6   9
to
     4
   /     7     2
 / \   / 9   6 3   1
Trivia:
This problem was inspired by this original tweet by Max Howell:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

翻转二叉树
  1. /**
  2. * Definition for a binary tree node.
  3. * public class TreeNode {
  4. * public int val;
  5. * public TreeNode left;
  6. * public TreeNode right;
  7. * public TreeNode(int x) { val = x; }
  8. * }
  9. */
  10. public class Solution {
  11. public TreeNode InvertTree(TreeNode root) {
  12. if(root==null||(root.left==null&&root.right==null)) return root;
  13. var tem = root.left;
  14. root.left = root.right;
  15. root.right = tem;
  16. if(root.right!=null){
  17. InvertTree(root.right);
  18. }
  19. if(root.left!=null){
  20. InvertTree(root.left);
  21. }
  22. return root;
  23. }
  24. }





226反转二叉树 Invert Binary Tree

标签:ica   size   mono   weight   bsp   public   20px   amp   div   

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 mamicode.com 版权所有 京ICP备13008772号-2
迷上了代码!