From 1e62f49e8d29dc804506f444a91f0b3dd4c1e5f3 Mon Sep 17 00:00:00 2001
From: CyC2018 <1029579233@qq.com>
Date: Wed, 7 Mar 2018 13:51:08 +0800
Subject: [PATCH] auto commit

---
 notes/算法.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/notes/算法.md b/notes/算法.md
index e6c51e85..6c638f29 100644
--- a/notes/算法.md
+++ b/notes/算法.md
@@ -619,7 +619,7 @@ public static Comparable select(Comparable[] a, int k) {
 
 # 查找
 
-本章使用三种经典的数据类型来实现高效的符号表：二叉查找树、红黑树和散列表。
+本章使用三种经典的数据结构来实现高效的符号表：二叉查找树、红黑树和散列表。
 
 ## 1. 符号表