码迷,mamicode.com
首页 >  
搜索关键字:d. gukiz and binary    ( 11754个结果
[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
Problem Path Sum
Problem Description:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equ...
分类:其他好文   时间:2014-07-07 19:03:39    阅读次数:165
Problem Flatten Binary Tree
Problem Description:Given a binary tree, flatten it to a linked list in-place.Solution:对二叉树进行前序遍历(pre-order). 1 public void flatten(TreeNode root) { 2...
分类:其他好文   时间:2014-07-07 18:47:24    阅读次数:306
Problem Path Sum II
Problem Description:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Solution: 递归。 1 public List>...
分类:其他好文   时间:2014-07-07 16:59:12    阅读次数:169
Problem Binary Tree Postorder Traversal
Problem Description:Given a binary tree, return thepostordertraversal of its nodes' valuesSolution: 1 public List postorderTraversal(TreeNode root) { ...
分类:其他好文   时间:2014-07-07 16:45:23    阅读次数:177
[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][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
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
Scramble String
题目 Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great /...
分类:其他好文   时间:2014-06-29 23:16:19    阅读次数:312
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!