2017年7月17日
[LeetCode] 104. Maximum Depth of Binary Tree Java
摘要： 题目： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthe 阅读全文
posted @ 2017-07-17 21:02 荒野第一快递员 阅读(214) 评论(0) 推荐(0)
[LeetCode] 102. Binary Tree Level Order Traversal Java
摘要： 题目： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tre 阅读全文
posted @ 2017-07-17 20:13 荒野第一快递员 阅读(181) 评论(0) 推荐(0)
[LeetCode] 101. Symmetric Tree Java
摘要： 题目： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is sy 阅读全文
posted @ 2017-07-17 09:56 荒野第一快递员 阅读(238) 评论(0) 推荐(0)