二叉树
夏天的风欧阳冰嫣
这个作者很懒,什么都没留下…
展开
-
刷题leetcode--532. K-diff Pairs in an Array
532. K-diff Pairs in an Array 2018.1.11Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer原创 2018-01-11 17:05:26 · 189 阅读 · 0 评论 -
JavaScript实现排序二叉树(数据结构)
被腾讯面试了2小时算法挂掉的前端不是好前端谁让前端JS那么火呢?SO 重新学习数据结构和算法吧!排序算法对前端来说非常重要!排序二叉树: 左子树小于根节点,右子树大于根节点,子树也满足这样的条件,这样的树叫做排序二叉树。所以JavaScript构建这样一个二叉树的过程如下:var BinaryTree = { var Node = function(){ }//定义二叉树的节点Node ...原创 2018-03-19 19:06:16 · 2246 阅读 · 0 评论 -
刷题leetcode_669. Trim a Binary Search Tree
二叉搜索树(binary search tree)定义二叉搜索树:二叉树中任何节点的键值一定大于其左子树中每一个节点的键值,并且小于其右子树中每一个节点的键值。查找基于此,在二叉搜索树中搜索最小元素和最大元素是方便的,从根节点开始,一直往左走,直至无路可走,就得到了最小元素;从跟节点开始,一直往右走,直至无路可走,就得到了最大元素。 查找任何一个节点原创 2018-01-09 21:47:20 · 149 阅读 · 0 评论 -
刷题leetcode--563. Binary Tree Tilt
2018.1.8路上的风景很精彩!享受过程!563. Binary Tree TiltGiven a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subt原创 2018-01-08 17:30:59 · 155 阅读 · 0 评论 -
刷题leetcode--654. Maximum Binary Tree
2018.1.8 15:47Fighting!Leetcode.654. Maximum Binary TreeGiven an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum numb原创 2018-01-08 15:22:53 · 199 阅读 · 0 评论 -
刷题leetcode--617. Merge Two Binary Trees
617. Merge Two Binary TreesGiven two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need原创 2018-01-08 13:50:52 · 166 阅读 · 0 评论 -
刷题leetcode102 Binary Tree Level Order Traversal
2018.1.7 FightingGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7]原创 2018-01-07 17:57:36 · 151 阅读 · 0 评论 -
刷题leetcode100 SameTree
2018.1.7加油!!Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the sam原创 2018-01-07 16:41:37 · 159 阅读 · 0 评论 -
刷题leetcode623 Add One Row to Tree
2018.1.7 10:42amGiven the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.The adding rule is: giv原创 2018-01-07 10:21:28 · 251 阅读 · 0 评论 -
刷题leetcode--530. Minimum Absolute Difference in BST
530. Minimum Absolute Difference in BST2018.1.11Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.Example:Input:原创 2018-01-11 15:22:31 · 257 阅读 · 0 评论 -
JS遍历DOM树—(二叉树算深度优先遍历特例)
目录:二叉 DOM 树的遍历:前序,中序,后序多叉 DOM 树的遍历:广度优先搜索(队列),深度优先搜索(栈)二叉 DOM 树的前序、中序、后序遍历,是深度优先遍历的特例二叉 DOM 树的遍历[javascript] view plain copyfunction Tree() { var Node = function(key){ this...原创 2018-03-23 17:15:53 · 926 阅读 · 0 评论