Trees — Interview English Scripts¶
本章共 15 題。
題目對照表¶
| # | Problem | Source | English Script |
|---|---|---|---|
| 1 | Invert Binary Tree | 題解 | 講稿 |
| 2 | Maximum Depth of Binary Tree | 題解 | 講稿 |
| 3 | Diameter of Binary Tree | 題解 | 講稿 |
| 4 | Balanced Binary Tree | 題解 | 講稿 |
| 5 | Same Tree | 題解 | 講稿 |
| 6 | Subtree of Another Tree | 題解 | 講稿 |
| 7 | Lowest Common Ancestor BST | 題解 | 講稿 |
| 8 | Binary Tree Level Order Traversal | 題解 | 講稿 |
| 9 | Binary Tree Right Side View | 題解 | 講稿 |
| 10 | Count Good Nodes | 題解 | 講稿 |
| 11 | Validate BST | 題解 | 講稿 |
| 12 | Kth Smallest Element BST | 題解 | 講稿 |
| 13 | Construct Binary Tree | 題解 | 講稿 |
| 14 | Binary Tree Maximum Path Sum | 題解 | 講稿 |
| 15 | Serialize Deserialize Binary Tree | 題解 | 講稿 |
說明¶
- 所有講稿採固定 10 段面試口述模板。
- 英文句型偏短，適合即時口說。
[CHECK]表示來源未明確定義，需面試時先問清楚。