mirror of
https://github.com/cheetahlou/CategoryResourceRepost.git
synced 2025-11-03 15:53:44 +08:00
63 lines
2.2 KiB
Markdown
63 lines
2.2 KiB
Markdown
<audio id="audio" title="春节7天练 | Day 5：二叉树和堆" controls="" preload="none"><source id="mp3" src="https://static001.geekbang.org/resource/audio/31/5d/31ac1e889dcd87249425c641544b725d.mp3"></audio>
|
||
|
||
你好，我是王争。春节假期进入尾声了。你现在是否已经准备返回工作岗位了呢？今天更新的是测试题的第五篇，我们继续来复习。
|
||
|
||
## 关于二叉树和堆的7个必知必会的代码实现
|
||
|
||
### 二叉树
|
||
|
||
<li>
|
||
实现一个二叉查找树，并且支持插入、删除、查找操作
|
||
</li>
|
||
<li>
|
||
实现查找二叉查找树中某个节点的后继、前驱节点
|
||
</li>
|
||
<li>
|
||
实现二叉树前、中、后序以及按层遍历
|
||
</li>
|
||
|
||
### 堆
|
||
|
||
<li>
|
||
实现一个小顶堆、大顶堆、优先级队列
|
||
</li>
|
||
<li>
|
||
实现堆排序
|
||
</li>
|
||
<li>
|
||
利用优先级队列合并K个有序数组
|
||
</li>
|
||
<li>
|
||
求一组动态数据集合的最大Top K
|
||
</li>
|
||
|
||
## 对应的LeetCode练习题（@Smallfly 整理）
|
||
|
||
- Invert Binary Tree（翻转二叉树）
|
||
|
||
英文版：[https://leetcode.com/problems/invert-binary-tree/](https://leetcode.com/problems/invert-binary-tree/)
|
||
|
||
中文版：[https://leetcode-cn.com/problems/invert-binary-tree/](https://leetcode-cn.com/problems/invert-binary-tree/)
|
||
|
||
- Maximum Depth of Binary Tree（二叉树的最大深度）
|
||
|
||
英文版：[https://leetcode.com/problems/maximum-depth-of-binary-tree/](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
|
||
|
||
中文版：[https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)
|
||
|
||
- Validate Binary Search Tree（验证二叉查找树）
|
||
|
||
英文版：[https://leetcode.com/problems/validate-binary-search-tree/](https://leetcode.com/problems/validate-binary-search-tree/)
|
||
|
||
中文版：[https://leetcode-cn.com/problems/validate-binary-search-tree/](https://leetcode-cn.com/problems/validate-binary-search-tree/)
|
||
|
||
- Path Sum（路径总和）
|
||
|
||
英文版：[https://leetcode.com/problems/path-sum/](https://leetcode.com/problems/path-sum/)
|
||
|
||
中文版：[https://leetcode-cn.com/problems/path-sum/](https://leetcode-cn.com/problems/path-sum/)
|
||
|
||
做完题目之后，你可以点击“请朋友读”，把测试题分享给你的朋友。
|
||
|
||
祝你取得好成绩！明天见！
|