algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

修改错别字: 20201003二叉树周末总结.md

Browse Source 
修改错别字
This commit is contained in:
Yanshi XU
2024-03-16 18:02:00 +08:00
committed by GitHub
parent 77a4de1f41
commit cff7999479
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/周总结/20201003二叉树周末总结.md
View File

@ -13,7 +13,7 @@
而本题的迭代法中我们使用了队列，需要注意的是这不是层序遍历，而且仅仅通过一个容器来成对的存放我们要比较的元素，认识到这一点之后就发现：用队列，用栈，甚至用数组，都是可以的。
那么做完本题之后，在看如下两个题目。
那么做完本题之后，再看如下两个题目。
* [100.相同的树](https://leetcode.cn/problems/same-tree/description/)
* [572.另一个树的子树](https://leetcode.cn/problems/subtree-of-another-tree/)