码迷,mamicode.com
首页 >  
搜索关键字:element traversal    ( 13647个结果
[LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.方法一:最先想到的就是递归,注...
分类:其他好文   时间:2014-07-10 09:58:40    阅读次数:224
栈---链表实现
栈:是一种后进先出(LIFO)的结构,对其插入删除只能在栈顶进行;链表实现节点:#include#includetypedef struct Node *PtrToNode;typedef PtrToNode Stack;struct Node{ int Element; struct No...
分类:其他好文   时间:2014-07-07 23:48:05    阅读次数:224
[LeetCode] Single Number
Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity...
分类:其他好文   时间:2014-07-07 23:24:09    阅读次数:210
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.方法:在inorder中寻找...
分类:其他好文   时间:2014-07-07 23:18:53    阅读次数:283
[leetcode] Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
分类:其他好文   时间:2014-07-07 23:02:31    阅读次数:193
[LeetCode] Single Number II
Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp...
分类:其他好文   时间:2014-07-07 22:57:13    阅读次数:309
[Leetcode][Tree][Binary Tree Preorder Traversal]
二叉树的前序遍历:root点先被访问,然后是left和right子节点。迭代的版本也相对好写。1、递归版本:时间复杂度O(N),空间复杂度O(N) 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int va...
分类:其他好文   时间:2014-07-07 20:35:24    阅读次数:158
[Leetcode][Tree][Binary Tree Inorder Traversal]
二叉树的中序遍历1、递归版本/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) :...
分类:其他好文   时间:2014-07-07 20:00:20    阅读次数:161
[Leetcode][Tree][Binary Tree Postorder Traversal]
二叉树的后续遍历1、递归版本/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) :...
分类:其他好文   时间:2014-06-30 14:17:28    阅读次数:306
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
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!