春节7天练 | Day 5：二叉树和堆
<p><img src="https://static001.geekbang.org/resource/image/2b/c5/2b6d78bbac6ff5bafef934a323ab00c5.jpg" alt="" /></p>
<p>你好，我是王争。春节假期进入尾声了。你现在是否已经准备返回工作岗位了呢？今天更新的是测试题的第五篇，我们继续来复习。</p>
<hr />
<h2>关于二叉树和堆的 7 个必知必会的代码实现</h2>
<h3>二叉树</h3>
<ul>
<li>
<p>实现一个二叉查找树，并且支持插入、删除、查找操作</p>
</li>
<li>
<p>实现查找二叉查找树中某个节点的后继、前驱节点</p>
</li>
<li>实现二叉树前、中、后序以及按层遍历</li>
</ul>
<h3>堆</h3>
<ul>
<li>
<p>实现一个小顶堆、大顶堆、优先级队列</p>
</li>
<li>
<p>实现堆排序</p>
</li>
<li>
<p>利用优先级队列合并 K 个有序数组</p>
</li>
<li>求一组动态数据集合的最大 Top K</li>
</ul>
<h2>对应的 LeetCode 练习题（@Smallfly 整理）</h2>
<ul>
<li>Invert Binary Tree（翻转二叉树）</li>
</ul>
<p>英文版：<a href="https://leetcode.com/problems/invert-binary-tree/"><a href="https://leetcode.com/problems/invert-binary-tree/">https://leetcode.com/problems/invert-binary-tree/</a></a></p>
<p>中文版：<a href="https://leetcode-cn.com/problems/invert-binary-tree/"><a href="https://leetcode-cn.com/problems/invert-binary-tree/">https://leetcode-cn.com/problems/invert-binary-tree/</a></a></p>
<ul>
<li>Maximum Depth of Binary Tree（二叉树的最大深度）</li>
</ul>
<p>英文版：<a href="https://leetcode.com/problems/maximum-depth-of-binary-tree/"><a href="https://leetcode.com/problems/maximum-depth-of-binary-tree/">https://leetcode.com/problems/maximum-depth-of-binary-tree/</a></a></p>
<p>中文版：<a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/"><a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/">https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/</a></a></p>
<!-- [[[read_end]]] -->
<ul>
<li>Validate Binary Search Tree（验证二叉查找树）</li>
</ul>
<p>英文版：<a href="https://leetcode.com/problems/validate-binary-search-tree/"><a href="https://leetcode.com/problems/validate-binary-search-tree/">https://leetcode.com/problems/validate-binary-search-tree/</a></a></p>
<p>中文版：<a href="https://leetcode-cn.com/problems/validate-binary-search-tree/"><a href="https://leetcode-cn.com/problems/validate-binary-search-tree/">https://leetcode-cn.com/problems/validate-binary-search-tree/</a></a></p>
<ul>
<li>Path Sum（路径总和）</li>
</ul>
<p>英文版：<a href="https://leetcode.com/problems/path-sum/"><a href="https://leetcode.com/problems/path-sum/">https://leetcode.com/problems/path-sum/</a></a></p>
<p>中文版：<a href="https://leetcode-cn.com/problems/path-sum/"><a href="https://leetcode-cn.com/problems/path-sum/">https://leetcode-cn.com/problems/path-sum/</a></a></p>
<hr />
<p>做完题目之后，你可以点击“请朋友读”，把测试题分享给你的朋友。</p>
<p>祝你取得好成绩！明天见！</p>