码迷,mamicode.com
首页 >  
搜索关键字:inorder traversal    ( 1831个结果
[Leetcode][Tree][Binary Tree Level Order Traversal ]
树的层次遍历,比较简单,3个题的做法完全一样,只是在特定的地方对结果进行reverse。1、Binary Tree Level Order Traversal/** * Definition for binary tree * struct TreeNode { * int val; * ...
分类:其他好文   时间:2014-07-07 16:39:56    阅读次数:194
[Leetcode][Tree][Construct Binary Tree from Preorder/Postorder and Inorder Traversal ]
从树的中序遍历+前/后序遍历重建一棵树。必须使用iterator才能过,否则会MLE。1、preorder + inorder第一个版本,使用坐标范围: 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int...
分类:其他好文   时间:2014-07-07 14:11:10    阅读次数:147
DFS & BFS
DFS 深度优先BFS 广度优先DFS或者BFS都是在联通区域内遍历节点的方法用在二叉树上DFS有preOreder,inOrder,postOrder,BFS就是层次遍历。在二叉树上的节点,只有两个选择,left 和right,即,对于每一个节点,in 有1个, out 有两个,有向图在矩阵的节点...
分类:其他好文   时间:2014-07-01 21:32:46    阅读次数:278
leecode Binary Tree Level Order Traversal II java
做完这道题,只能说基本功很重要,数组中套数组就不会用了,过几天吧1做了,看自己到底等没。https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/import java.util.*;/** * Definition ...
分类:编程语言   时间:2014-07-01 13:30:53    阅读次数:300
leetcode 题解:Binary Tree Level Order Traversal (二叉树的层序遍历)
题目: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,...
分类:其他好文   时间:2014-07-01 12:44:09    阅读次数:199
leetcode题解:Tree Level Order Traversal II (二叉树的层序遍历 2)
题目:Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For ...
分类:其他好文   时间:2014-07-01 12:26:07    阅读次数:215
Binary Tree Preorder Traversal
题目 Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,2,3]. Note: Recu...
分类:其他好文   时间:2014-07-01 07:06:56    阅读次数:177
Binary Tree Postorder Traversal
题目 Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [3,2,1]. Note: Rec...
分类:其他好文   时间:2014-07-01 07:06:11    阅读次数:214
LeetCode: Binary Tree Postorder Traversal [145]
【题目】 Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [3,2,1]. Note: Recursive solution is trivial, could you do it iteratively? 【题意】 非递归实现后续遍...
分类:其他好文   时间:2014-06-30 10:10:10    阅读次数:177
LeetCode: Binary Tree Preorder Traversal [144]
【题目】 Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? 【题意】 非递归返回先序遍历...
分类:其他好文   时间:2014-06-30 06:21:18    阅读次数:334
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!