2015年7月7日
【leetcode】Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2015-07-07 16:09 匡子语 阅读(194) 评论(0) 推荐(0)
【leetcode】Binary Tree Level Order Traversal I & II
摘要： Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2015-07-07 15:54 匡子语 阅读(221) 评论(0) 推荐(0)