摘要：
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 farthest le... 阅读全文
posted @ 2015-07-20 21:55
~每天进步一点点~
阅读(110)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2015-07-20 21:50
~每天进步一点点~
阅读(144)
评论(0)
推荐(0)
摘要：
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-20 21:18
~每天进步一点点~
阅读(143)
评论(0)
推荐(0)
摘要：
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-20 16:59
~每天进步一点点~
阅读(116)
评论(0)
推荐(0)
浙公网安备 33010602011771号