码迷,mamicode.com
首页 >  
搜索关键字:nodes    ( 4030个结果
[LeetCode] Binary Tree Zigzag Level Order Traversal(bfs)
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-08-05 00:18:28    阅读次数:225
leetcode-Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of...
分类:其他好文   时间:2014-08-03 23:28:56    阅读次数:261
[LeetCode]Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. /** ...
分类:其他好文   时间:2014-08-03 12:54:55    阅读次数:201
POJ2309 BST
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repe...
分类:其他好文   时间:2014-08-03 12:49:15    阅读次数:229
[LeetCode]Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. /** * Definition for binary tree ...
分类:其他好文   时间:2014-08-02 23:32:04    阅读次数:232
Swap Nodes in Pairs
问题:交换相邻的两个结点分析:建立新链表每次插入ret->next后在插入ret,需要在判断下若最后只有一个结点不需要交换,注意每次交换了结点要把尾结点的下一个指向空class Solution {public: ListNode *swapPairs(ListNode *head) { ...
分类:其他好文   时间:2014-08-02 18:16:13    阅读次数:178
DevExpress TreeList利用递归绑定数据
private void TreeListBind(DataTable dt, int p) { treeList1.Nodes.Clear(); if (dt.Rows.Count < 1) return; ...
分类:其他好文   时间:2014-08-02 09:55:43    阅读次数:377
[leetcode笔记] Remove Duplicates from Sorted List II
问题描述:Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->...
分类:其他好文   时间:2014-08-02 01:33:12    阅读次数:249
Binary Tree
Description Background  Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. Th...
分类:其他好文   时间:2014-08-01 19:39:52    阅读次数:207
EasyUI父节点(parent)处理方法
function save(){ var nodes = $('#funcSelectTree').tree('getChecked');//获取所有打勾的节点 var flag = false; var array = new Ar...
分类:其他好文   时间:2014-08-01 18:30:12    阅读次数:227
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!