Skip to content

Create 35 2021-12-14 Binary tree.md #27

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Dec 25, 2021
Merged

Create 35 2021-12-14 Binary tree.md #27

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
592cc00
Create 35 2021-12-14 Binary tree.md
ytyubox Dec 7, 2021
874d7f0
add 236 by Yu
ytyubox Dec 13, 2021
46cca38
Update 35 2021-12-14 Binary tree.md
ytyubox Dec 14, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions 紀錄/35 2021-12-14 Binary tree.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
# LeetCode 讀書會第 35 次聚會 2021/12/14

## leetcode 讀書會通知

1. 項目: 第 35 次聚會
2. 目的: 線上一起寫題目, 由有想法的人帶領, 先解題, 再看該題有趣的解法
3. 時間: 12/14 (二) 20:00 ~ 21:00
4. 地點: google meet 線上 (前 10 分鐘預備鏈接)
5. 解題項目: [Binary Tree](https://leetcode.com/explore/learn/card/data-structure-tree/)
6. 共筆: GitHub https://github.com/programmingbookclub/Leetcode-club
7. 備註:

當然這次要說到 3 題 MEDIUM！（立 Flag！） 116、117、236


* MEDIUM 116 Populating Next Right Pointers in Each Node https://leetcode.com/problems/populating-next-right-pointers-in-each-node
* MEDIUM 117 Populating Next Right Pointers in Each Node II https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii
* MEDIUM 236 Lowest Common Ancestor of a Binary Tree https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree
* HARD 297 Serialize and Deserialize Binary Tree https://leetcode.com/problems/serialize-and-deserialize-binary-tree

---
Notes: