码迷,mamicode.com
首页 >  
搜索关键字:binary tree right si    ( 32903个结果
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.class Solution...
分类:其他好文   时间:2014-07-03 20:25:21    阅读次数:219
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.此题目有两种解决思路:1)递归...
分类:其他好文   时间:2014-07-03 20:07:01    阅读次数:199
关于margin与padding的关系
当一个Div块div1里面放着另一个div块div2时1、div1的width,height即content的宽和高为div2的margin-top与margin-bottom和left与right之间的距离;2、当div里面padding有值时,且div2的margin有值时,则div1的边框距离...
分类:其他好文   时间:2014-07-03 20:05:04    阅读次数:192
[leetcode] Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.
分类:其他好文   时间:2014-07-03 19:44:18    阅读次数:161
[leetcode] Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).
分类:其他好文   时间:2014-07-03 19:36:49    阅读次数:196
[leetcode] Same Tree
Given two binary trees, write a function to check if they are equal or not.
分类:其他好文   时间:2014-07-03 19:26:46    阅读次数:213
[leetcode] Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
分类:其他好文   时间:2014-07-03 19:20:42    阅读次数:189
[leetcode] Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.
分类:其他好文   时间:2014-07-03 19:16:03    阅读次数:149
[leetcode] Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ...
分类:其他好文   时间:2014-07-03 19:14:34    阅读次数:206
[leetcode] Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.
分类:其他好文   时间:2014-07-03 19:13:08    阅读次数:187
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!