2015 年 4月 25 日随笔档案 - Pickle

摘要：递归求二叉树的最大深度。/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x... 阅读全文

posted @ 2015-04-25 23:18 Pickle 阅读(164) 评论(0) 推荐(0)

摘要：层次遍历，深刻理解树和递归。/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int... 阅读全文

posted @ 2015-04-25 22:42 Pickle 阅读(178) 评论(0) 推荐(0)

摘要：关于镜像树的相关操作，利用递归可以很简单的解决问题。注意判断根节点是不是null/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNod... 阅读全文

posted @ 2015-04-25 21:32 Pickle 阅读(150) 评论(0) 推荐(0)