2016年11月15日

103. Binary Tree Zigzag Level Order Traversal (Tree, Queue; BFS)

摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文

posted @ 2016-11-15 21:54 joannae 阅读(205) 评论(0) 推荐(0)

102. Binary Tree Level Order Traversal (Tree, Queue; BFS)

摘要： 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 tree [3, 阅读全文

posted @ 2016-11-15 21:46 joannae 阅读(215) 评论(0) 推荐(0)

导航