树（Tree）和二叉树
tree使用Redis构建二叉树——可缩短系统响应时间（redisbinary）
随着全球互联网网站的日益增多，系统响应时间的要求不断提高，传统的通讯技术和计算技术对此无能为力，有必要使用树结构技术来构建系统架构，从而缩短系统响应时间。 Tree使用Redis构建二叉树是一种可行的技术，它主要基于缓存服务Redis来实现。Redis具有快速、可靠、可扩展优点，能够解决大多数动态Web交互场景下响应时间问题。 构建树结构可以分为以下步骤：首先，使用 Redis建立二叉树并将
日期 2023-06-12 10:48:40![[LeetCode] Binary Tree Paths - 二叉树基础系列题目](/scriptcss/images/04.png)
[LeetCode] Binary Tree Paths - 二叉树基础系列题目
题目概述：Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 All root-to-leaf paths are: ["1- 2- 5", "1- 3"] 题目解析：本题主要考察二叉树遍历操作，输出二叉树的所有路径，通常采用递归方
日期 2023-06-12 10:48:40LeetCode:114_Flatten Binary Tree to Linked List | 将一棵二叉树变成链表的形式 | Medium
要求：Given a binary tree, flatten it to a linked list in-place.将二叉树转化为平坦序列的树。比如： 结题思路： 该题有个提示，转化后的树的序列正好是二叉树前序遍历所得到的序列，所以，该题第一个思路就是利用前序遍历的方式来做。 第二个思路：我们可以利用递归的思路，先对根节点进行处理，将root的左子树放到右子树，在将左子树中的最右端节点
日期 2023-06-12 10:48:40
LeetCode：105_Construct Binary Tree from Preorder and Inorder Traversal | 根据前序和中序遍历构建二叉树 | Medium
要求：通过二叉树的前序和中序遍历序列构建一颗二叉树 代码如下： 1 struct TreeNode { 2 int val; 3 TreeNode *left; 4 TreeNode *right; 5 TreeNode(int x): val(x),left(NULL), right(NULL) {} 6 };
日期 2023-06-12 10:48:40
LeetCode：104_Maximum Depth of Binary Tree | 二叉树的最大深度 | Easy
要求：求二叉树的深度（二叉树的深度为最远叶子节点到根节点的距离，即根节点到最远叶子节点的距离） 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
日期 2023-06-12 10:48:40LeetCode之Balanced Binary Tree 平衡二叉树
判定一棵二叉树是不是二叉平衡树。 链接：https://oj.leetcode.com/problems/balanced-binary-tree/ 题目描述： Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as
日期 2023-06-12 10:48:40![PAT 1110 Complete Binary Tree[判断完全二叉树]](/scriptcss/images/02.png)
PAT 1110 Complete Binary Tree[判断完全二叉树]
1110 Complete Binary Tree（25 分） Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, the fi
日期 2023-06-12 10:48:40![PAT 1064 Complete Binary Search Tree[二叉树][难]](/scriptcss/images/05.png)
PAT 1064 Complete Binary Search Tree[二叉树][难]
1064 Complete Binary Search Tree (30)（30 分） A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains on
日期 2023-06-12 10:48:40leetCode 94.Binary Tree Inorder Traversal（二叉树中序遍历） 解题思路和方法
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2]. Note:&nbs
日期 2023-06-12 10:48:40leetcode 114.Flatten Binary Tree to Linked List （将二叉树转换链表） 解题思路和方法
Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \
日期 2023-06-12 10:48:40java TreeMap 源代码分析 平衡二叉树
TreeMap 的实现就是红黑树数据结构，也就说是一棵自平衡的排序二叉树，这样就可以保证当需要快速检索指定节点。 TreeSet 和 TreeMap 的关系 为了让大家了解 TreeMap 和 TreeSet 之间的关系，下面先看 TreeSet 类的部分源代码： public class TreeSet<E> extends AbstractSet<E>
日期 2023-06-12 10:48:40[LeetCode] 1261. Find Elements in a Contaminated Binary Tree 在受污染的二叉树中查找元素
Given a binary tree with the following rules: root.val == 0 If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x + 1 If treeNode.val == x an
日期 2023-06-12 10:48:40[LeetCode] 1145. Binary Tree Coloring Game 二叉树着色游戏
Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and&nb
日期 2023-06-12 10:48:40[LeetCode] 998. Maximum Binary Tree II 最大二叉树之二
We are given the root node of a maximum tree: a tree where every node has a value greater than any other value in its subtree. Just as in the previous problem, the given tre
日期 2023-06-12 10:48:40[LeetCode] 993. Cousins in Binary Tree 二叉树的表兄弟节点
In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Two nodes of a binary tree are cousins if they have the same depth, b
日期 2023-06-12 10:48:40[LeetCode] 968. Binary Tree Cameras 二叉树相机
Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and its immediate children. Calculate the minimum number of cameras
日期 2023-06-12 10:48:40[LeetCode] 965. Univalued Binary Tree 单值二叉树
A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1: Input: [1,1,1,1,1,null,1] Output: tru
日期 2023-06-12 10:48:40[LeetCode] 958. Check Completeness of a Binary Tree 检查二叉树的完全性
Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is com
日期 2023-06-12 10:48:40[LeetCode] Encode N-ary Tree to Binary Tree 将N叉树编码为二叉树
Design an algorithm to encode an N-ary tree into a binary tree and decode the binary tree to get the original N-ary tree. An N-ary tree is a rooted tree in which each node has no more than N c
日期 2023-06-12 10:48:40[LeetCode] 814. Binary Tree Pruning 二叉树修剪
We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not contain
日期 2023-06-12 10:48:40[LeetCode] 662. Maximum Width of Binary Tree 二叉树的最大宽度
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a fu
日期 2023-06-12 10:48:40[LeetCode] 623. Add One Row to Tree 二叉树中增加一行
Given 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 addi
日期 2023-06-12 10:48:40[LeetCode] Binary Tree Tilt 二叉树的坡度
Given 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 subtree node values a
日期 2023-06-12 10:48:40[LintCode] Identical Binary Tree 相同二叉树
Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value. Have you met this question in a real in
日期 2023-06-12 10:48:40[LintCode] Binary Tree Paths 二叉树路径
Given a binary tree, return all root-to-leaf paths.ExampleGiven the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths ar
日期 2023-06-12 10:48:40[LeetCode] 297. Serialize and Deserialize Binary Tree 二叉树的序列化和去序列化
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection li
日期 2023-06-12 10:48:40[CareerCup] 4.4 Create List at Each Depth of Binary Tree 二叉树的各层创建链表
4.4 Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you'll have D linked lists).
日期 2023-06-12 10:48:40[LeetCode] 103. 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 alternate between). For example:
日期 2023-06-12 10:48:40[LeetCode] 144. Binary Tree Preorder Traversal 二叉树的先序遍历
Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] Follow up: Recursi
日期 2023-06-12 10:48:40[LeetCode] 104. 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. Note: A leaf is a node with
日期 2023-06-12 10:48:40leetcode 236. Lowest Common Ancestor of a Binary Tree 二叉树的最近公共祖先(中等)
一、题目大意 给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。 百度百科中最近公共祖先的定义为：“对于有根树 T 的两个节点 p、q，最近公共祖先表示为一个节点 x，满足
日期 2023-06-12 10:48:40