Chapter 05 optional 03 comments updated.

liuyubobobo · liuyubobobo · commit cf7c6c32ddaa · 2017-07-05T12:53:49.000-07:00
diff --git a/05-Binary-Search-Tree/Course Code (C++)/Optional-03-Predecessor-and-Successor/main.cpp b/05-Binary-Search-Tree/Course Code (C++)/Optional-03-Predecessor-and-Successor/main.cpp
@@ -495,7 +495,8 @@ void shuffle( int arr[], int n ){
     }
 }
 
-// 测试二分搜索树中的floor和ceil两个函数
+
+// 测试二分搜索树中的predecessor和successor两个函数
 int main(){
 
     // 生成 0 到 N-1 一共 N 个数字的数组

Original file line number	Diff line number	Diff line change
`@@ -495,7 +495,8 @@ void shuffle( int arr[], int n ){`
`495`	`495`	`}`
`496`	`496`	`}`
`497`	`497`
`498`		`-// 测试二分搜索树中的floor和ceil两个函数`
	`498`	`+`
	`499`	`+// 测试二分搜索树中的predecessor和successor两个函数`
`499`	`500`	`int main(){`
`500`	`501`
`501`	`502`	`// 生成 0 到 N-1 一共 N 个数字的数组`