From 67f4538b54b3d8f46297828eea30aa63f7131764 Mon Sep 17 00:00:00 2001
From: halfrost <ydz627@gmail.com>
Date: Fri, 21 Jan 2022 22:22:22 +0800
Subject: [PATCH] Update

---
 website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md | 2 +-
 .../0700~0799/0700.Search-in-a-Binary-Search-Tree.md            | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
index b775fc70..3028424f 100644
--- a/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
+++ b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
@@ -116,6 +116,6 @@ func max(a, b int) int {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0389.Find-the-Difference/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0390.Elimination-Game/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0392.Is-Subsequence/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
index 9d0dfe07..6473f7c7 100644
--- a/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
@@ -76,5 +76,5 @@ func searchBST(root *TreeNode, val int) *TreeNode {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0600~0699/0699.Falling-Squares/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree/">下一页➡️</a></p>
 </div>