From 11ce111169889fe1f56bf6ceffe8aace13106263 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=A9=BB=E9=AD=82=E5=9C=A3=E4=BD=BF?= <lingsixuans@qq.com>
Date: Thu, 5 Sep 2024 23:35:08 +0800
Subject: [PATCH] =?UTF-8?q?=E5=B0=86=E7=BA=A2=E9=BB=91=E6=A0=91=E4=B8=AD?=
 =?UTF-8?q?=E7=9A=84=E4=B8=80=E4=BA=9B=E6=96=B9=E6=B3=95=E4=BF=AE=E6=94=B9?=
 =?UTF-8?q?=E4=B8=BAconst?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 include/RedBlackTree.h | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/include/RedBlackTree.h b/include/RedBlackTree.h
index 714a13b..12d8e80 100644
--- a/include/RedBlackTree.h
+++ b/include/RedBlackTree.h
@@ -130,20 +130,20 @@ namespace ling {
 
         /// 查找元素
         /// 区别于findSearch，此方法会在没有匹配时返回接近的节点
-        Node *iterativeSearch(T key);
+        Node *iterativeSearch(T key) const;
 
-        Node *findSearch(T key);
+        Node *findSearch(T key) const;
 
         /// 根节点
-        Node *getRoot() {
+        Node *getRoot() const {
             return rootNode;
         }
 
         // 查找最小结点：返回tree为根结点的红黑树的最小结点。
-        Node *minimum();
+        Node *minimum() const;
 
         // 查找最大结点：返回tree为根结点的红黑树的最大结点。
-        Node *maximum();
+        Node *maximum() const;
 
 #define rb_parent(r)   ((r)->parent)
 #define rb_color(r) ((r)->color)
@@ -157,7 +157,7 @@ namespace ling {
     };
 
     template<typename T>
-    typename RedBlackTree<T>::Node *RedBlackTree<T>::maximum() {
+    typename RedBlackTree<T>::Node *RedBlackTree<T>::maximum() const {
         Node *tree = rootNode;
         if (tree == nullptr)
             return nullptr;
@@ -168,7 +168,7 @@ namespace ling {
     }
 
     template<typename T>
-    typename RedBlackTree<T>::Node *RedBlackTree<T>::minimum() {
+    typename RedBlackTree<T>::Node *RedBlackTree<T>::minimum() const {
         Node *tree = rootNode;
         if (tree == nullptr)
             return nullptr;
@@ -366,12 +366,12 @@ namespace ling {
     }
 
     template<typename T>
-    typename RedBlackTree<T>::Node *RedBlackTree<T>::findSearch(T key) {
+    typename RedBlackTree<T>::Node *RedBlackTree<T>::findSearch(T key) const {
         return findSearch(rootNode, key);
     }
 
     template<typename T>
-    typename RedBlackTree<T>::Node *RedBlackTree<T>::iterativeSearch(T key) {
+    typename RedBlackTree<T>::Node *RedBlackTree<T>::iterativeSearch(T key) const {
         return iterativeSearch(rootNode, key);
     }