- 博客(2)
- 收藏
- 关注
RSS订阅原创 Binary Tree Paths (二叉树路径遍历)
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2->5", "1->3"] 题目：给一个二
2015-11-12 23:29:05
410
原创 Binary Tree Level Order Traversal（二叉树层序遍历）
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,9,20,#,#,15,7}, 3 / \ 9 20
2015-11-06 22:44:19
425
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人