![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Leetcode刷题
文章平均质量分 81
stephen_csdn
这个作者很懒,什么都没留下…
展开
-
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 · 431 阅读 · 0 评论 -
Binary Tree Paths (二叉树路径遍历)
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]题目:给一个二原创 2015-11-12 23:29:05 · 413 阅读 · 0 评论