文章 2015-06-02 来自:开发者社区

[LeetCode] Binary Tree Level Order Traversal

A classic tree traversal problem. I share my two solutions here: BFS and DFS. BFS: 1 vector<vector<int>> levelOrder(TreeNode *root) { 2 vector<vector<int>> leve...

文章 2015-03-03 来自:开发者社区

【LeetCode从零单排】No102 Binary Tree Level Order Traversal

题目 &nbsp; &nbsp; &nbsp; &nbsp;Given a binary tree, return the&nbsp;level order&nbsp;traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree&nbsp;{3,9,20...

文章 2014-12-09 来自:开发者社区

[LeetCode]103.Binary Tree Zigzag Level Order Traversal

【题目】 Given a binary tree, return the&nbsp;zigzag level order&nbsp;traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Gi...

文章 2014-12-08 来自:开发者社区

[LeetCode]102.Binary Tree Level Order Traversal

【题目】 Given a binary tree, return the&nbsp;level order&nbsp;traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree&nbsp;{3,9,20,#,#,15,7}, 3 / \ 9 20 ....

文章 2014-11-27 来自:开发者社区

LeetCode: 103_Binary Tree Zigzag Level Order Traversal | 二叉树Zigzag层次遍历 | Medium

本题也属于层次遍历的变形,不同之处在于其遍历的方法是交替进行的,形成一个ZigZag的曲线形式,如下: 代码如下: 1 struct TreeNode { 2 int val; 3 TreeNode* left; 4 TreeNode* right; 5 TreeNode(int x): val(x), left(...

文章 2014-11-27 来自:开发者社区

LeetCode: 107_Binary Tree Level Order Traversal II | 二叉树自底向上的层次遍历 | Easy

本题和上题一样同属于层次遍历,不同的是本题从底层往上遍历,如下: 代码如下: 1 struct TreeNode { 2 int val; 3 TreeNode* left; 4 TreeNode* right; 5 TreeNode():val(0),left(NULL),right(NULL){} 6 ...

文章 2014-11-27 来自:开发者社区

LeetCode: 102_Binary Tree Level Order Traversal | 二叉树自顶向下的层次遍历 | Easy

题目:Binay 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,#,...

文章 2014-10-16 来自:开发者社区

[leetcode]107.Binary Tree Level Order Traversal II

【题目】 Given a binary tree, return the&nbsp;bottom-up level order&nbsp;traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree&nbsp;{3,...

本页面内关键词为智能算法引擎基于机器学习所生成,如有任何问题,可在页面下方点击"联系我们"与我们沟通。

算法编程

开发者社区在线编程频道官方技术圈。包含算法资源更新,周赛动态,每日一题互动。

+关注