These articles are somehow kinds of **Algorithmic Thinking**. All based on LeetCode problems, but NOT only the code of solution, but also **why** writing code this way, **how** we figure it out.
*[Interval Scheduling: Intersections of Intervals](think_like_computer/Interval%20Problem%20(III)%20Interval%20Intersection.md)
*[烧饼排序](算法思维系列/烧饼排序.md)
*[滑动窗口技巧](算法思维系列/滑动窗口技巧.md)
*[字符串乘法](算法思维系列/字符串乘法.md)
*[常用的位操作](算法思维系列/常用的位操作.md)
*[信封嵌套问题](算法思维系列/信封嵌套问题.md)
*[回溯算法团灭排列、组合、子集问题](高频面试系列/子集排列组合.md)
*[几个反直觉的概率问题](算法思维系列/几个反直觉的概率问题.md)
*[洗牌算法](算法思维系列/洗牌算法.md)
*[递归详解](算法思维系列/递归详解.md)
1、翻译首先要通顺，符合英文的语法，对基本的专业术语应该做到正确地使用，诸如 Queue, stack, binary tree 等，这种词语用错会让人很迷惑。对于不容易翻译出来的中文，可以按你的理解修改。翻译完成后一定要用工具检查一下基本语法，**比如将你的英文文本粘贴到 Word 中，查看是否有基本的语法错误**。
In the previous article about [framework thinking](../think_like_computer/学习数据结构和算法的高效方法.md), we introduced the traverse framework of the binary tree. There should be a deep impression of this framework left in your mind. In this article, we will put the framework into practice and illustrate how does it flexible resolve all issues about the binary tree.
In the previous article about [framework thinking](../algorithmic_thinking/学习数据结构和算法的高效方法.md), we introduced the traverse framework of the binary tree. There should be a deep impression of this framework left in your mind. In this article, we will put the framework into practice and illustrate how does it flexible resolve all issues about the binary tree.
The basic idea of binary tree algorithm design: Defining the manipulation in the current node and the last things are thrown to the framework.
1、翻译首先要通顺，符合英文的语法，对基本的专业术语应该做到正确地使用，诸如 Queue, stack, binary tree 等，这种词语用错会让人很迷惑。对于不容易翻译出来的中文，可以按你的理解修改。翻译完成后一定要用工具检查一下基本语法，**比如将你的英文文本粘贴到 Word 中，查看是否有基本的语法错误**。
