Skip to content

Create 34-20211130-binaryTree.md #25

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.

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 2 commits into from
Dec 7, 2021
Merged
Changes from 1 commit
Commits
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
25 changes: 25 additions & 0 deletions 紀錄/34-20211130-binaryTree.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
# LeetCode 讀書會第 34 次聚會 2021/11/30

## leetcode 讀書會通知

1. 項目: 第 34 次聚會
2. 目的: 線上一起寫題目, 由有想法的人帶領, 先解題, 再看該題有趣的解法
3. 時間: 11/30 (二) 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. 備註:

上次因為固定會說話的朋友沒有參加,我自己不習慣一直講話,導致我自己覺得尷尬,希望這次會好一點(我是說有其他人講話的部分)


* EASY 112 Path Sum https://leetcode.com/problems/path-sum
* MEDIUM 106 Construct Binary Tree from Inorder and Postorder Traversal https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
* MEDIUM 105 Construct Binary Tree from Preorder and Inorder Traversal https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
* 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: