### 数据结构专题

**树**

* [树的遍历](./BTT.scala) Easy
* [镜像二叉树 迭代](./Leetcode_Interview_27.scala) Easy
* [另一个树的子树](./Leetcode_572_Tree.scala) Easy
* [平衡二叉树](./Leetcode_110_Tree.scala) Easy
* [二叉树的层平均值](./Leetcode_637_Tree.scala) Easy
* [找出二叉树中第二小的节点](./Leetcode_671_Tree.scala) Easy
* [N叉树的后序遍历](./LeetCode_590.scala) Easy
* [N叉树的前序遍历](./Leetcode_589.scala) Easy
* [N叉树的最大深度](./Leetcode_559.scala) Easy
* [二叉搜索树的最近公共祖先](./Leetcode_235.scala) Easy
* [统计左叶子节点的和](./Leetcode_404_Tree.scala) Easy
* [最小路径](./Leetcode_111_Tree.scala) Easy
* [路径总和](./Leetcode_112_Tree.scala) Easy
* [二叉搜索树中的众数](./Leetcode_501.scala) Easy
* [二叉搜索树的最小绝对差](./Leetcode_530.scala) Easy
* [二叉树的堂兄弟节点](./Leetcode_993.scala) Easy
* [二叉树的坡度](./Leetcode_563.scala) Easy
* [根据二叉树创建字符串](./Leetcode_606.scala) Easy
* [两数之和 IV - 输入 BST](./Leetcode_653.scala) Easy
* [修剪二叉搜索树](./Leetcode_669.scala) Easy
* [二叉搜索树中的搜索](./Leetcode_700.scala) Easy
* [二叉搜索树节点最小距离](./Leetcode_783.scala) Easy
* [检查平衡性](./Leetcode_Interview_0404.scala) Easy
* [叶子相似的树](./Leetcode_872.scala) Easy
* [递增顺序查找树](./Leetcode_897.scala) Easy
* [单值二叉树](./Leetcode_965.scala) Easy
* [对称的二叉树](./Leetcode_JZ_28.scala) Easy
* [平衡二叉树](./Leetcode_JZ_55_2.scala) Easy
* [从根到叶的二进制数之和](./Leetcode_1022.scala) Easy
* [BiNode @unchecked](./Leetcode_Interview_17_12.scala) Easy
* [不同的二叉搜索树 II](./Leetcode_95.scala) Medium
* [二叉树的锯齿形层次遍历](./Leetcode_103.scala) Medium
* [合法二叉搜索树](./Leetcode_Interview_0405.scala) Medium
* [从中序与后续遍历序列构造二叉树](./Leetcode_106.scala) Medium
* [路径总和 II](./Leetcode_113.scala) Medium
* [在二叉树中分配硬币](./Leetcode_979.scala) Medium
* [从叶结点开始的最小字符串](./Leetcode_988.scala) Medium
* [按垂序遍历返回其结点值](./Leetcode_987.scala) Medium
* [最大二叉树 II](./Leetcode_998.scala) Medium
* [先序遍历构造二叉树](./Leetcode_1008.scala) Medium
* [填充每个节点的下一个右侧节点指针](./Leetcode_116.scala) Medium
* [填充每个节点的下一个右侧节点指针 II](./Leetcode_117.scala)
* [分裂二叉树的最大乘积](./Leetcode_1339.scala) Medium
* [求根到叶子节点数字之和](./Leetcode_129.scala) Medium
* [二叉树的前序遍历 迭代](./Leetcode_129.scala) Medium
* [二叉搜索树迭代器](./Leetcode_173.scala) Medium
* [二叉树最大宽度](./Leetcode_662.scala) Medium
* [二叉树的右视图](./Leetcode_199.scala) Medium
* [完全二叉树的节点个数](./Leetcode_222.scala) Medium
* [二叉搜索树中第K小的元素](./Leetcode_230.scala) Medium
* [层数最深叶子节点的和](./Leetcode_1302.scala) Medium
* [N叉树的层序遍历](./Leetcode_429.scala) Medium
* [序列化和反序列化二叉搜索树](./Leetcode_449.scala) Medium
* [删除二叉搜索树中的节点](./Leetcode_450.scala) Medium
* [出现次数最多的子树元素和](./Leetcode_508.scala) Medium

**其他**

* [最大面值（LintCode 669）](./CoinChange.scala)
* [反转数字](./Leetcode_7.scala) Easy
* [求S中符合J的元素的个数](./Leetcode_771.scala) Easy
* [IP 地址无效化](./Leetcode_1108.scala) Easy 
* [访问所有点的最小时间](./Leetcode_1266.scala) Easy   
* [整数的各位积和之差](./Leetcode_1281.scala) Easy
* [统计位数为偶数的数字](./Leetcode_1295.scala) Easy  
* [将每个元素替换为右侧最大元素](./Leetcode_1299.scala) Easy  
* [统计有序矩阵中的负数](./Leetcode_1351.scala) Easy   
* [删除排序数组中的重复项 II](./Leetcode_80_Array.scala) Medium
* [有序矩阵中第K小的元素](./Leetcode_378_Array.scala) Medium
* [嵌套数组](./Leetcode_565_Array.scala) Medium
* [优美的排列 II](./Leetcode_667_Array.scala) Medium
* [数组的度](./Leetcode_697_Array.scala) Easy
* [托普利茨矩阵](./Leetcode_766_Array.scala) Easy
* [最多能完成排序的块](./Leetcode_769_Array.scala) Medium 
* [猜数字](Leetcode_LCP_1.scala) Easy  
* [使用最小花费爬楼梯](./Leetcode_746.scala) Easy  
* [区域和检索 - 数组不可变](Leetcode_303.scala) Easy
* [机器人能否返回原点](./Leetcode_657.scala) Easy
* [等价多米诺骨牌对的数量](./Leetcode_1128.scala) Easy
* [从有序链表中删除重复节点](./Leetcode_83_ListNode.scala) Easy
* [无重复字符的最长子串](./Leetcode_3.scala) Medium

### LeetCode 热题 HOT 100

* [合并二叉树](./Leetcode_617_Tree.scala) Easy
* [翻转二叉树](./Leetcode_226_Tree.scala) Easy
* [二叉树的最大深度](./Leetcode_104_Tree.scala) Easy
* [链表反转](./Leetcode_206_ListNode.scala) Easy
* [归并两个有序的链表](./Leetcode_21_ListNode.scala) Easy
* [相交链表](./Leetcode_160.scala) Easy
* [股票的最大利润](./Leetcode_121.scala) Easy
* [对称二叉树](./Leetcode_101_Tree.scala) Easy
* [最大子序和](./Leetcode_53.scala) Easy
* [两节点的最长路径](./Leetcode_543_Tree.scala) Easy
* [爬楼梯](./Leetcode_70.scala) Easy
* [两数之和](./Leetcode_1_Array.scala) Easy  
* [比特位计数](Leetcode_338.scala) Medium
* [二叉树的中序遍历 迭代](./Leetcode_94.scala) Medium
* [二叉树展开为链表](./Leetcode_114.scala) Medium
* [不同的二叉搜索树](./Leetcode_96.scala) Medium
* [从前序与中序遍历序列构造二叉树](./Leetcode_105.scala) Medium
* [最小路径和](./Leetcode_64.scala) Medium
* [二叉树的最近公共祖先](./Leetcode_236.scala) Medium
* [寻找重复数](./Leetcode_287_Array.scala) Medium
* [把二叉搜索树转换为累加树](./Leetcode_538.scala) Easy
* [二叉树的层序遍历](./Leetcode_102.scala) Medium
* [间隔遍历/打家劫舍 III](./Leetcode_337_Tree.scala) Medium
* [路径总和 III](./Leetcode_437_Tree.scala) Medium
* [打家劫舍](./Leetcdoe_198.scala) Easy
* [搜索二维矩阵 II](./Leetcode_240_Array.scala) Medium
* [两数相加](./Leetcode_2_ListNode.scala) Medium  
* [验证二叉搜索树](./Leetcode_98.scala) Medium
* [最小栈](./Leetcode_155.scala) Easy
* [杨辉三角 II](./Leetcode_119.scala) Easy
* [子集](./Leetcode_78.scala) Medium
* [全排列](./Leetcode_46.scala) Medium
* [括号生成](./Leetcode_22.scala) Medium
* [组合总和](./Leetcode_39.scala) Medium
* [电话号码的字母组合](./Leetcode_17.scala) Medium
* [单词搜索](./Leetcode_79.scala) Medium
* [每日温度](./Leetcode_739.scala) Medium
* [回文子串](./Leetcode_647.scala) Medium
* [前 K 个高频元素](./Leetcode_347.scala) Medium