99-恢复二叉搜索树(Recover Binary Search Tree) 原文链接: https://leetcode-cn.com/problems/recover-binary-search-tree 英文原文You are given the root of a binary search tree ( 2021-12-03 二叉搜索树二叉树树深度优先搜索 中等
100-相同的树(Same Tree) 原文链接: https://leetcode-cn.com/problems/same-tree 英文原文Given the roots of two binary trees p and q, write a function to 2021-12-03 二叉树广度优先搜索树深度优先搜索 简单
101-对称二叉树(Symmetric Tree) 原文链接: https://leetcode-cn.com/problems/symmetric-tree 英文原文Given the root of a binary tree, check whether it is a mirro 2021-12-03 二叉树广度优先搜索树深度优先搜索 简单
102-二叉树的层序遍历(Binary Tree Level Order Traversal) 原文链接: https://leetcode-cn.com/problems/binary-tree-level-order-traversal 英文原文Given the root of a binary tree, return t 2021-12-03 二叉树广度优先搜索树 中等
104-二叉树的最大深度(Maximum Depth of Binary Tree) 原文链接: https://leetcode-cn.com/problems/maximum-depth-of-binary-tree 英文原文Given the root of a binary tree, return its ma 2021-12-03 二叉树广度优先搜索树深度优先搜索 简单
105-从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 原文链接: https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal 英文原文Given two integer 2021-12-03 二叉树分治哈希表数组树 中等
106-从中序与后序遍历序列构造二叉树(Construct Binary Tree from Inorder and Postorder Traversal) 原文链接: https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal 英文原文Given two intege 2021-12-03 二叉树分治哈希表数组树 中等
107-二叉树的层序遍历 II(Binary Tree Level Order Traversal II) 原文链接: https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii 英文原文Given the root of a binary tree, retur 2021-12-03 二叉树广度优先搜索树 中等
108-将有序数组转换为二叉搜索树(Convert Sorted Array to Binary Search Tree) 原文链接: https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree 英文原文Given an integer array nums wher 2021-12-03 二叉搜索树二叉树分治数组树 简单
109-有序链表转换二叉搜索树(Convert Sorted List to Binary Search Tree) 原文链接: https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree 英文原文Given the head of a singly linked 2021-12-03 二叉搜索树二叉树分治树链表 中等