![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154121-6a75fca1dd66e.png\")
<\/p>\n<\/p>\n\u76ee\u5f55<\/p>\n
\u5f15\u8a00：<\/p>\n
1.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6982\u5ff5<\/p>\n
2.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6027\u80fd\u5206\u6790<\/p>\n
3.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u539f\u7406<\/p>\n
4.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u67e5\u627e\u539f\u7406<\/p>\n
5.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5220\u9664\u539f\u7406<\/p>\n
6.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5b9e\u73b0<\/p>\n
6.1.\u6784\u5efa\u521d\u67b6\u6784<\/p>\n
\u62d3\u5c55：using\u5173\u952e\u5b57<\/p>\n
6.2.\u63d2\u5165\u5b9e\u73b0（Insert）<\/p>\n
6.3.\u6790\u6784\u5b9e\u73b0<\/p>\n
6.4.Print\u5b9e\u73b0（\u6d4b\u8bd5）<\/p>\n
6.5.\u67e5\u627e\u5b9e\u73b0（find）<\/p>\n
6.6.\u5220\u9664\u5b9e\u73b0（erase）<\/p>\n
6.7.\u62f7\u8d1d\u6784\u9020，\u8d4b\u503c\u5b9e\u73b0<\/p>\n
6.8.\u6e90\u7801<\/p>\n
7.\u4e8c\u53c9\u641c\u7d22\u6811key\u548ckey\/value\u4f7f\u7528\u573a\u666f<\/p>\n
7.1.key\u641c\u7d22\u573a\u666f（\u5bf9\u5e94set\u5bb9\u5668）<\/p>\n
7.2.key\/value\u641c\u7d22\u573a\u666f（\u5bf9\u5e94map\u5bb9\u5668）<\/p>\n
7.3.key\/value\u4e8c\u53c9\u641c\u7d22\u6811\u4ee3\u7801\u5b9e\u73b0<\/p>\n
\u7ed3\u8bed：<\/p>\n
\u4ece\u672c\u7bc7\u5f00\u59cb，\u6211\u4eec\u6b63\u5f0f\u8fdb\u5165\u9ad8\u9636\u6570\u636e\u7ed3\u6784\u7684\u5b66\u4e60\u9636\u6bb5\u3002 \u6807\u51c6\u8fdb\u9636\u5b66\u4e60\u8def\u7ebf\u63a8\u8350：\u666e\u901a\u4e8c\u53c9\u641c\u7d22\u6811 \u2192 \u5e73\u8861\u4e8c\u53c9\u641c\u7d22\u6811 \u2192 AVL \u6811 \u2192 \u7ea2\u9ed1\u6811 \u2192 B \u6811 \/ B + \u6811\u7cfb\u5217\u3002<\/p>\n
\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u6240\u6709\u540e\u7eed\u5e73\u8861\u6811\u7684\u57fa\u77f3，\u4e5f\u662f C++ set\/map\u7684\u5e95\u5c42\u539f\u578b，\u975e\u5e38\u91cd\u8981\u3002<\/p>\n
\u90a3\u4e48\u8bdd\u4e0d\u591a\u8bf4，\u76f4\u63a5\u8fdb\u5165\u6b63\u6587\u2014\u2014\u2014\u2014><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n<\/p>\n
\u4e8c\u53c9\u641c\u7d22\u6811\u53c8\u79f0\u4e8c\u53c9\u6392\u5e8f\u6811，\u5b83\u6216\u8005\u662f\u4e00\u68f5\u7a7a\u6811，\u6216\u8005\u662f\u5177\u6709\u4ee5\u4e0b\u6027\u8d28\u7684\u4e8c\u53c9\u6811:<\/p>\n
\u8fd9\u79cd\u5c31\u662f\u4e8c\u53c9\u641c\u7d22\u6811<\/p>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca20d0f3.png\")
<\/p>\n
\u7279\u522b\u6ce8\u610f：<\/span>\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u5e8f\u904d\u5386\u5f97\u5230\u5347\u5e8f\u5e8f\u5217\u3002<\/span><\/p>\n \u4e8c\u53c9\u6811\u5de6\u5b50\u6811\u4e2d\u6240\u6709\u8282\u70b9\u4e00\u5b9a\u4e0d\u5927\u4e8e\u6839\u8282\u70b9，\u53f3\u5b50\u6811\u4e2d\u6240\u6709\u8282\u70b9\u4e00\u5b9a\u4e0d\u5c0f\u4e8e\u6839\u8282\u70b9 ，\u4e2d\u5e8f\u904d\u5386\u7684\u8bbf\u95ee\u987a\u5e8f\u662f\u5de6\u4e2d\u53f3，\u6240\u4ee5\u4ee5\u4e2d\u5e8f\u904d\u5386\u5f97\u5230\u7684\u5e8f\u5217\u5c31\u662f\u5347\u5e8f\u5e8f\u5217<\/span><\/p>\n<\/p>\n \u6700\u4f18\u60c5\u51b5\u4e0b，\u4e8c\u53c9\u641c\u7d22\u6811\u4e3a\u5b8c\u5168\u4e8c\u53c9\u6811 (\u6216\u8005\u63a5\u8fd1\u5b8c\u5168\u4e8c\u53c9\u6811)，\u5176\u9ad8\u5ea6\u4e3a：log N<\/p>\n \u6700\u5dee\u60c5\u51b5\u4e0b，\u4e8c\u53c9\u641c\u7d22\u6811\u9000\u5316\u4e3a\u5355\u652f\u6811 (\u6216\u8005\u7c7b\u4f3c\u5355\u652f)，\u5176\u9ad8\u5ea6\u4e3a：N<\/p>\n \u6240\u4ee5\u7efc\u5408\u800c\u8a00\u4e8c\u53c9\u641c\u7d22\u6811\u589e\u5220\u67e5\u6539\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a：O(N)<\/p>\n \u90a3\u4e48\u8fd9\u6837\u7684\u6548\u7387\u663e\u7136\u662f\u65e0\u6cd5\u6ee1\u8db3\u6211\u4eec\u9700\u6c42\u7684，\u6211\u540e\u7eed\u4f1a\u7ee7\u7eed\u8bb2\u89e3\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u53d8\u5f62，\u5e73\u8861\u4e8c\u53c9\u641c\u7d22\u6811 AVL \u6811\u548c\u7ea2\u9ed1\u6811，\u624d\u80fd\u9002\u7528\u4e8e\u6211\u4eec\u5728\u5185\u5b58\u4e2d\u5b58\u50a8\u548c\u641c\u7d22\u6570\u636e\u3002\u4e8c\u53c9\u641c\u7d22\u6811\u4e3b\u8981\u662f\u4e3a\u4e86\u6253\u597d\u94fa\u57ab<\/p>\n \u53e6\u5916\u9700\u8981\u8bf4\u660e\u7684\u662f，\u4e8c\u5206\u67e5\u627e\u4e5f\u53ef\u4ee5\u5b9e\u73b0O(log\u00a0N)\u7ea7\u522b\u7684\u67e5\u627e\u6548\u7387，\u4f46\u662f\u4e8c\u5206\u67e5\u627e\u6709\u4e24\u5927\u7f3a\u9677：<\/p>\n \u8fd9\u91cc\u4e5f\u5c31\u4f53\u73b0\u51fa\u4e86\u5e73\u8861\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u4ef7\u503c\u3002<\/p>\n<\/p>\n \u6211\u8fd9\u91cc\u5148\u8bb2\u7406\u8bba，\u540e\u5b9e\u73b0<\/p>\n \u63d2\u5165\u7684\u5177\u4f53\u8fc7\u7a0b\u5982\u4e0b：<\/p>\n \u5c31\u6bd4\u5982，\u4e00\u4e2a\u4e8c\u53c9\u641c\u7d22\u6811\u5df2\u7ecf\u6784\u5efa\u6210\u4e86\u8fd9\u6837<\/p>\n \u6211\u60f3\u63d2\u516516\u5c31\u8d70\u8fd9\u6761\u7ea2\u7ebf\u8def<\/p>\n \u6211\u60f3\u63d2\u51653\u5c31\u8d70\u8fd9\u6761\u7ea2\u7ebf\u8def（\u8fd9\u91cc\u76f8\u540c\u60c5\u51b5\u4e0b\u662f\u5f80\u53f3\u8d70，\u5f80\u5de6\u8d70\u5f53\u7136\u4e5f\u53ef\u4ee5，\u53ea\u8981\u903b\u8f91\u4e00\u81f4\u5c31\u53ef\u4ee5）<\/p>\n \u9996\u5148\u67e5\u627e\u5143\u7d20\u662f\u5426\u5728\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d，\u5982\u679c\u4e0d\u5b58\u5728，\u5219\u8fd4\u56de false\u3002 \u5982\u679c\u67e5\u627e\u5143\u7d20\u5b58\u5728\u5219\u5206\u4ee5\u4e0b\u56db\u79cd\u60c5\u51b5\u5206\u522b\u5904\u7406：（\u5047\u8bbe\u8981\u5220\u9664\u7684\u7ed3\u70b9\u4e3a N）<\/p>\n \u5bf9\u5e94\u4ee5\u4e0a\u56db\u79cd\u60c5\u51b5\u7684\u89e3\u51b3\u65b9\u6848：<\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u6211\u4eec\u8bbe\u8ba1\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u65f6\u5019\u4f1a\u6709\u4fe9\u4efd\u7248\u672c，\u4e00\u4efd\u662f\u652f\u6301\u5197\u4f59\u7684（\u6709\u91cd\u590d\u6570\u5b57），\u4e00\u4efd\u662f\u4e0d\u652f\u6301\u5197\u4f59\u7684（\u6ca1\u6709\u91cd\u590d\u6570\u5b57），\u8fd9\u5176\u5b9e\u5c31\u662fset\u548cmap\u5e95\u5c42\u7684\u533a\u522b，\u6211\u4eec\u8fd9\u91cc\u5b9e\u73b0\u4e0d\u652f\u6301\u5197\u4f59\u7684\u7248\u672c<\/p>\n \u6211\u4eec\u8fd9\u91cc\u5b9e\u73b0\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u5b9e\u73b0\u4e86\u589e\u5220\u67e5\u7684\u529f\u80fd，\u6539\u4e0d\u5b9e\u73b0，\u56e0\u4e3a\u666e\u901a\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u4e0d\u5141\u8bb8\u4fee\u6539\u7684（\u56e0\u4e3a\u5982\u679c\u6539\u4e86，\u90a3\u6811\u5c31\u53ef\u80fd\u4e0d\u662f\u4e8c\u53c9\u641c\u7d22\u6811\u4e86，\u6027\u8d28\u5c31\u88ab\u7834\u574f\u4e86）<\/p>\n #pragma once }<\/p>\n K _val = 0; template<class K> private: BSTNode\u5c31\u662f\u4ee3\u8868\u8282\u70b9，BSTree\u5c31\u662f\u6811<\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u6211\u4eec\u5148\u524d\u7528\u91cd\u547d\u540d\u7528\u7684\u662ftypedef，\u4e5f\u5c31\u662f<\/p>\n typedef BSTNode<K> Node;<\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u91cc\u62d3\u5c55\u4e00\u70b9，\u6211\u4eec\u53ef\u4ee5\u7528using\u5173\u952e\u5b57\u6765\u8fdb\u884c\u91cd\u547d\u540d，\u8fd9\u6548\u679c\u662fC++11\u540e\u65b0\u589e\u7684\u4e1c\u897f，\u73b0\u5728\u53ef\u4ee5\u4ecetypedef\u8f6c\u5230\u7528using，\u56e0\u4e3ausing\u5728\u666e\u901a\u573a\u666f\u4e0b\u6548\u679c\u548ctypedef\u662f\u4e00\u6837\u7684，\u4f46\u5728\u6709\u4e9b\u573a\u666f\u633a\u6709\u7528，\u5177\u4f53\u4f1a\u5728C++11\u90e8\u5206\u5177\u4f53\u8bb2using，\u8fd9\u4e2a\u7528\u6cd5\u4e5f\u5f88\u7b80\u5355，\u5c31\u662f\u5982\u4e0b\u8fd9\u6837<\/p>\n using Node = BSTNode<K>; <\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u91cc\u5b9e\u73b0\u7684\u662f\u65e0\u91cd\u590d\u6570\u636e\u7248\u672c<\/p>\n template<class K> insert\u51fd\u6570\u6d89\u53ca\u4e86\u5806\u5185\u5b58\u7684\u5f00\u8f9f，\u90a3\u6211\u4eec\u5c31\u5b9e\u73b0\u4e00\u4e0b\u6790\u6784<\/p>\n \/\/\u7c7b\u5185 \/\/\u7c7b\u5916 \u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u91cc\u5b9e\u73b0Print\u51fd\u6570\u662f\u4e3a\u4e86\u6d4b\u8bd5\u5b9e\u73b0\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u6709\u6ca1\u6709\u95ee\u9898，\u4e3a\u4e86\u4e0d\u8ba9\u5916\u90e8\u76f4\u63a5\u8c03\u7528\u5e26\u53c2\u7684Print，\u6211\u4eec\u53ef\u4ee5\u5c01\u88c5\u4e00\u5c42,\u7136\u540e\u628a\u5e26\u53c2\u7684Print\u8bbe\u4e3a\u79c1\u6709<\/p>\n template<class K> template<class K> \u63a5\u4e0b\u6765，\u6211\u4eec\u6d4b\u8bd5\u4e00\u4e0binsert\u6709\u6ca1\u6709\u95ee\u9898<\/p>\n #define _CRT_SECURE_NO_WARNINGS cout << endl;<\/p>\n BSTree<string> bsts; return 0; \u5bf9\u4e8e\u5185\u7f6e\u7c7b\u578b\u548c\u81ea\u5b9a\u4e49\u7c7b\u578b\u90fd\u662f\u6ca1\u95ee\u9898\u7684<\/p>\n<\/p>\n template<class K> \u6d4b\u8bd5\u4e00\u4e0b<\/p>\n template<class K> \u6211\u7528\u8fd9\u4efd\u6d4b\u8bd5\u4ee3\u7801\u6d4b\u8bd5\u4e00\u4e0b<\/p>\n #define _CRT_SECURE_NO_WARNINGS bsti.erase(3); bsti.erase(14); bsti.erase(8); \/\/BSTree<string> bsts; return 0; \u6ca1\u6709\u95ee\u9898\u00a0<\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u4e3a\u4e86\u9884\u9632\u6d45\u62f7\u8d1d，\u6700\u540e\u628a\u62f7\u8d1d\u6784\u9020\u548c\u8d4b\u503c\u5b9e\u73b0\u4e00\u4e0b\u5c31OK\u4e86<\/p>\n \/\/\u7c7b\u5185 BSTree() = default;<\/p>\n BSTree(const BSTree& bst) \/\/\u7c7b\u5916 template<class K> #pragma once }<\/p>\n K _val = 0; template<class K> \/\/typedef BSTNode<K> Node; BSTree() = default;<\/p>\n BSTree(const BSTree& bst) ~BSTree() private: template<class K> template<class K> template<class K> template<class K> template<class K> template<class K> template<class K> template<class K> \u4e8c\u53c9\u641c\u7d22\u6811\u4f7f\u7528\u4e3b\u8981\u662f\u4fe9\u4e2a\u573a\u666f，key\u641c\u7d22\u573a\u666f\u548ckey\/value\u641c\u7d22\u573a\u666f<\/p>\n<\/p>\n \u53ea\u6709 key \u4f5c\u4e3a\u5173\u952e\u7801，\u7ed3\u6784\u4e2d\u53ea\u9700\u8981\u5b58\u50a8 key \u5373\u53ef，\u5173\u952e\u7801\u5373\u4e3a\u9700\u8981\u641c\u7d22\u5230\u7684\u503c（\u4e5f\u5c31\u662f\u6211\u4eec\u4e0a\u9762\u5b9e\u73b0\u7684\u90a3\u79cdBST），\u641c\u7d22\u573a\u666f\u53ea\u9700\u8981\u5224\u65ad key \u5728\u4e0d\u5728\u3002key \u7684\u641c\u7d22\u573a\u666f\u5b9e\u73b0\u7684\u4e8c\u53c9\u6811\u641c\u7d22\u6811\u652f\u6301\u589e\u5220\u67e5，\u4f46\u662f\u4e0d\u652f\u6301\u4fee\u6539，\u4fee\u6539 key \u7834\u574f\u641c\u7d22\u6811\u7ed3\u6784\u4e86\u3002<\/p>\n \u573a\u666f 1：\u5c0f\u533a\u65e0\u4eba\u503c\u5b88\u8f66\u5e93，\u5c0f\u533a\u8f66\u5e93\u4e70\u4e86\u8f66\u4f4d\u7684\u4e1a\u4e3b\u8f66\u624d\u80fd\u8fdb\u5c0f\u533a，\u90a3\u4e48\u7269\u4e1a\u4f1a\u628a\u4e70\u4e86\u8f66\u4f4d\u7684\u4e1a\u4e3b\u7684\u8f66\u724c\u53f7\u5f55\u5165\u540e\u53f0\u7cfb\u7edf，\u8f66\u8f86\u8fdb\u5165\u65f6\u626b\u63cf\u8f66\u724c\u5728\u4e0d\u5728\u7cfb\u7edf\u4e2d，\u5728\u5219\u62ac\u6746，\u4e0d\u5728\u5219\u63d0\u793a\u975e\u672c\u5c0f\u533a\u8f66\u8f86，\u65e0\u6cd5\u8fdb\u5165\u3002<\/p>\n \u573a\u666f 2：\u68c0\u67e5\u4e00\u7bc7\u82f1\u6587\u6587\u7ae0\u5355\u8bcd\u62fc\u5199\u662f\u5426\u6b63\u786e，\u5c06\u8bcd\u5e93\u4e2d\u6240\u6709\u5355\u8bcd\u653e\u5165\u4e8c\u53c9\u641c\u7d22\u6811，\u8bfb\u53d6\u6587\u7ae0\u4e2d\u7684\u5355\u8bcd，\u67e5\u627e\u662f\u5426\u5728\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d，\u4e0d\u5728\u5219\u6ce2\u6d6a\u7ebf\u6807\u7ea2\u63d0\u793a\u3002（\u53ef\u4ee5\u628aVS\u6211\u4eec\u8f93\u9519\u5173\u952e\u8bcd\u7206\u7ea2\u7406\u89e3\u6210\u8fd9\u6837）<\/p>\n<\/p>\n key\u641c\u7d22\u573a\u666f\u7b80\u5355\u8bf4\u5c31\u662f\u5728\u4e0d\u5728（\u4e5f\u5c31\u662f\u5bf9\u5e94\u6211\u4eec\u4e4b\u540e\u7684set\u5bb9\u5668）<\/span><\/p>\n<\/p>\n \u6bcf\u4e00\u4e2a\u5173\u952e\u7801 key，\u90fd\u6709\u4e0e\u4e4b\u5bf9\u5e94\u7684\u503c value，value \u53ef\u4ee5\u4efb\u610f\u7c7b\u578b\u5bf9\u8c61\u3002\u6811\u7684\u7ed3\u6784\u4e2d (\u7ed3\u70b9) \u9664\u4e86\u9700\u8981\u5b58\u50a8 key \u8fd8\u8981\u5b58\u50a8\u5bf9\u5e94\u7684 value，\u589e \/ \u5220 \/ \u67e5\u8fd8\u662f\u4ee5 key \u4e3a\u5173\u952e\u5b57\u8d70\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u89c4\u5219\u8fdb\u884c\u6bd4\u8f83，\u53ef\u4ee5\u5feb\u901f\u67e5\u627e\u5230 key \u5bf9\u5e94\u7684 value\u3002key\/value \u7684\u641c\u7d22\u573a\u666f\u5b9e\u73b0\u7684\u4e8c\u53c9\u6811\u641c\u7d22\u6811\u652f\u6301\u4fee\u6539，\u4f46\u662f\u4e0d\u652f\u6301\u4fee\u6539 key，\u4fee\u6539 key \u7834\u574f\u641c\u7d22\u6811\u6027\u8d28\u4e86，\u53ef\u4ee5\u4fee\u6539 value<\/span>\u3002<\/p>\n \u573a\u666f 1：\u7b80\u5355\u4e2d\u82f1\u4e92\u8bd1\u5b57\u5178，\u6811\u7684\u7ed3\u6784\u4e2d (\u7ed3\u70b9) \u5b58\u50a8 key (\u82f1\u6587) \u548c value (\u4e2d\u6587)，\u641c\u7d22\u65f6\u8f93\u5165\u82f1\u6587，\u5219\u540c\u65f6\u67e5\u627e\u5230\u4e86\u82f1\u6587\u5bf9\u5e94\u7684\u4e2d\u6587\u3002<\/p>\n \u573a\u666f 2：\u5546\u573a\u65e0\u4eba\u503c\u5b88\u8f66\u5e93，\u5165\u53e3\u8fdb\u573a\u65f6\u626b\u63cf\u8f66\u724c，\u8bb0\u5f55\u8f66\u724c\u548c\u5165\u573a\u65f6\u95f4，\u51fa\u53e3\u79bb\u573a\u65f6，\u626b\u63cf\u8f66\u724c，\u67e5\u627e\u5165\u573a\u65f6\u95f4，\u7528\u5f53\u524d\u65f6\u95f4\u2011\u5165\u573a\u65f6\u95f4\u8ba1\u7b97\u51fa\u505c\u8f66\u65f6\u957f，\u8ba1\u7b97\u51fa\u505c\u8f66\u8d39\u7528，\u7f34\u8d39\u540e\u62ac\u6746，\u8f66\u8f86\u79bb\u573a\u3002<\/p>\n \u573a\u666f 3：\u7edf\u8ba1\u4e00\u7bc7\u6587\u7ae0\u4e2d\u5355\u8bcd\u51fa\u73b0\u7684\u6b21\u6570，\u8bfb\u53d6\u4e00\u4e2a\u5355\u8bcd，\u67e5\u627e\u5355\u8bcd\u662f\u5426\u5b58\u5728，\u4e0d\u5b58\u5728\u8fd9\u4e2a\u8bf4\u660e\u7b2c\u4e00\u6b21\u51fa\u73b0，（\u5355\u8bcd，1），\u5355\u8bcd\u5b58\u5728，\u5219 ++ \u5355\u8bcd\u5bf9\u5e94\u7684\u6b21\u6570\u3002<\/p>\n<\/p>\n \u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u4e2a\u5b9e\u73b0\u5176\u5b9e\u5c31\u662f\u5728\u539f\u5148\u7684key\u641c\u7d22\u573a\u666f\u7684\u57fa\u7840\u4e0a\u6539\u6539\u5c31\u884c\u4e86，\u8fd9\u91cc\u6211\u5c31\u76f4\u63a5\u653e\u4ee3\u7801\u4e86<\/p>\n namespace key_value }<\/p>\n K _key; template<class K, class V> \/\/typedef BSTNode<K> Node; BSTree() = default;<\/p>\n BSTree(const BSTree& bst) ~BSTree() private: template<class K, class V> template<class K, class V> template<class K, class V> template<class K, class V> template<class K, class V> template<class K, class V> template<class K, class V> template<class K, class V> \u5b9e\u73b0\u5b8c\u4e86\u540e\u53ef\u4ee5\u7528\u4e0b\u9762\u4fe9\u4efd\u6d4b\u8bd5\u4ee3\u7801\u6d4b\u8bd5\u4e00\u4e0b\u00a0<\/p>\n #define _CRT_SECURE_NO_WARNINGS int main() \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u90a3\u4e48，\u7528C++\u5b9e\u73b0\u7684\u9ad8\u9636\u6570\u636e\u7ed3\u6784\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u90e8\u5206\u7684\u5185\u5bb9\u5c31\u5168\u90e8\u8bb2\u89e3\u5b8c\u6bd5\u5566，\u5e0c\u671b\u4ee5\u4e0a\u5185\u5bb9\u5bf9\u4f60\u6709\u6240\u5e2e\u52a9，\u611f\u8c22\u89c2\u770b，\u82e5\u89c9\u5f97\u5199\u7684\u8fd8\u53ef\u4ee5，\u53ef\u4ee5\u5206\u4eab\u7ed9\u670b\u53cb\u4e00\u8d77\u6765\u770b\u54e6，\u6bd5\u7adf\u4e00\u8d77\u8fdb\u6b65\u66f4\u6709\u52a8\u529b\u561b，\u5f53\u7136\u80fd\u5173\u6ce8\u4e00\u4e0b\u5c31\u66f4\u597d\u5566\u3002<\/p>\n \u76ee\u5f55
\n2.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6027\u80fd\u5206\u6790<\/h2>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca21d93b.png\")
<\/p>\n
\n3.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u539f\u7406<\/h2>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca22e53c.png\")
<\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca23f3c7.png\")
<\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca25015b.png\")
<\/p>\n<\/p>\n
\n4.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u67e5\u627e\u539f\u7406<\/h2>\n
\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca262b97.png\")
<\/p>\n<\/p>\n
\n5.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5220\u9664\u539f\u7406<\/h2>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca274347.png\")
<\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca285395.png\")
<\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca295ff0.png\")
<\/p>\n<\/p>\n
\n6.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5b9e\u73b0<\/h2>\n
6.1.\u6784\u5efa\u521d\u67b6\u6784<\/h3>\n
\n#include <iostream>
\ntemplate<class K>
\nclass BSTNode
\n{
\npublic:
\nBSTNode() = default;
\nBSTNode(const K& _key)
\n:_val(_key)
\n, _left(nullptr)
\n, _right(nullptr)
\n{<\/p>\n
\nBSTNode<K>* _left = nullptr;
\nBSTNode<K>* _right = nullptr;
\n};<\/p>\n
\nclass BSTree
\n{
\nusing Node = BSTNode<K>;
\n\/\/typedef BSTNode<K> Node;
\npublic:<\/p>\n
\nNode* _root = nullptr;
\n}; <\/p>\n\u62d3\u5c55：using\u5173\u952e\u5b57<\/h4>\n
6.2.\u63d2\u5165\u5b9e\u73b0（Insert）<\/h3>\n
\nbool BSTree<K>::insert(const K& key)
\n{
\nif (_root == nullptr)
\n{
\nNode* node = new Node(key);
\n_root = node;
\nreturn true;
\n}
\nelse
\n{
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nparent = cur;
\nif (cur->_val > key)
\ncur = cur->_left;
\nelse if (cur->_val < key)
\ncur = cur->_right;
\nelse
\nreturn false;
\n}
\nNode* node = new Node(key);
\nif (parent->_val > key)
\nparent->_left = node;
\nelse
\nparent->_right = node;
\nreturn true;
\n}
\n}<\/p>\n6.3.\u6790\u6784\u5b9e\u73b0<\/h3>\n
\n \/\/…..
\n~BSTree()
\n{
\nDestroy(_root);
\n}
\nvoid Destroy(Node* root);
\n \/\/…<\/p>\n
\ntemplate<class K>
\nvoid BSTree<K>::Destroy(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nDestroy(root->_left);
\nDestroy(root->_right);
\ndelete root;
\n} <\/p>\n6.4.Print\u5b9e\u73b0（\u6d4b\u8bd5）<\/h3>\n
\nvoid BSTree<K>::Print()
\n{
\nPrint(_root);
\n}<\/p>\n
\nvoid BSTree<K>::Print(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nPrint(root->_left);
\nstd::cout << root->_val << " ";
\nPrint(root->_right);
\n} <\/p>\n
\n#include "Binary Search Tree.h"
\n#include <string>
\nusing namespace std;
\nint main()
\n{
\nBSTree<int> bsti;
\nbsti.insert(1);
\nbsti.insert(3);
\nbsti.insert(2);
\nbsti.insert(4);
\nbsti.insert(4);
\nbsti.Print();<\/p>\n
\nbsts.insert("ababab");
\nbsts.insert("baabab");
\nbsts.insert("aabbab");
\nbsts.insert("bbabab");
\nbsts.insert("bbabab");
\nbsts.Print();<\/p>\n
\n} <\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca2a6ffd.png\")
<\/p>\n6.5.\u67e5\u627e\u5b9e\u73b0（find）<\/h3>\n
\nbool BSTree<K>::find(const K& key)
\n{
\nNode* cur = _root;
\nwhile (cur)
\n{
\nif (cur->_val > key)
\ncur = cur->_left;
\nelse if (cur->_val < key)
\ncur = cur->_right;
\nelse
\nreturn true;
\n}
\nreturn false;
\n} <\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154122-6a75fca2c7e53.png\")
<\/p>\n<\/p>\n6.6.\u5220\u9664\u5b9e\u73b0（erase）<\/h3>\n
\nbool BSTree<K>::erase(const K& key)
\n{
\nif (_root == nullptr)
\nreturn false;
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nif (cur->_val > key)
\n{
\nparent = cur;
\ncur = cur->_left;
\n}
\nelse if (cur->_val < key)
\n{
\nparent = cur;
\ncur = cur->_right;
\n}
\nelse
\n{
\nif (cur->_left == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_right;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_right;
\nelse
\nparent->_left = cur->_right;
\n}
\ndelete cur;
\n}
\nelse if (cur->_right == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_left;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_left;
\nelse
\nparent->_left = cur->_left;
\n}
\ndelete cur;
\n}
\nelse
\n{
\nNode* sparent = cur;
\nNode* scur = cur->_right;
\nwhile (scur->_left)
\n{
\nsparent = scur;
\nscur = scur->_left;
\n}
\ncur->_val = scur->_val;
\nif (sparent == cur)
\nsparent->_right = scur->_right;
\nelse
\nsparent->_left = scur->_right;
\ndelete scur;
\nbreak;
\n}
\nreturn true;
\n}
\n}
\nreturn false;
\n} <\/p>\n
\n#include "Binary Search Tree.h"
\n#include <string>
\nusing namespace std;
\nint main()
\n{
\nint a[] = { 8,3,1,10,6,4,7,14,13 };
\nBSTree<int> bsti;
\nfor (auto x : a)
\nbsti.insert(x);
\nbsti.Print();
\ncout << endl;<\/p>\n
\nbsti.Print();
\ncout << endl;<\/p>\n
\nbsti.Print();
\ncout << endl;<\/p>\n
\nbsti.Print();
\ncout << endl;<\/p>\n
\n\/\/bsts.insert("ababab");
\n\/\/bsts.insert("baabab");
\n\/\/bsts.insert("aabbab");
\n\/\/bsts.insert("bbabab");
\n\/\/bsts.insert("bbabab");
\n\/\/bsts.Print();
\n\/\/cout << bsts.find("aabbab") << " " << bsts.find("aabbbb");<\/p>\n
\n} <\/p>\n![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154123-6a75fca3ae9ad.png\")
<\/p>\n<\/p>\n6.7.\u62f7\u8d1d\u6784\u9020，\u8d4b\u503c\u5b9e\u73b0<\/h3>\n
\nBSTree<K>& operator=(BSTree<K> bst);<\/p>\n
\n{
\n_root = Creat(bst._root);
\n}
\nNode* Creat(Node* root);<\/p>\n
\ntemplate<class K>
\ntypename BSTree<K>::Node* BSTree<K>::Creat(Node* root)
\n{
\nif (root == nullptr)
\nreturn nullptr;
\nNode* cur = new Node(root->_val);
\ncur->_left = Creat(root->_left);
\ncur->_right = Creat(root->_right);
\nreturn cur;
\n}<\/p>\n
\nBSTree<K>& BSTree<K>::operator=(BSTree<K> bst)
\n{
\nstd::swap(_root, bst._root);
\nreturn *this;
\n}<\/p>\n6.8.\u6e90\u7801<\/h3>\n
\n#include <iostream>
\ntemplate<class K>
\nclass BSTNode
\n{
\npublic:
\nBSTNode() = default;
\nBSTNode(const K& _key)
\n:_val(_key)
\n, _left(nullptr)
\n, _right(nullptr)
\n{<\/p>\n
\nBSTNode<K>* _left = nullptr;
\nBSTNode<K>* _right = nullptr;
\n};
\n\/\/<\/p>\n
\nclass BSTree
\n{
\nusing Node = BSTNode<K>;<\/p>\n
\npublic:
\nbool insert(const K& key);
\nbool find(const K& key);
\nbool erase(const K& key);
\nvoid Print();
\nBSTree<K>& operator=(BSTree<K> bst);<\/p>\n
\n{
\n_root = Creat(bst._root);
\n}<\/p>\n
\n{
\nDestroy(_root);
\n}<\/p>\n
\nNode* Creat(Node* root);
\nvoid Print(Node* root);
\nvoid Destroy(Node* root);
\nNode* _root = nullptr;
\n};<\/p>\n
\nbool BSTree<K>::insert(const K& key)
\n{
\nif (_root == nullptr)
\n{
\nNode* node = new Node(key);
\n_root = node;
\nreturn true;
\n}
\nelse
\n{
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nparent = cur;
\nif (cur->_val > key)
\ncur = cur->_left;
\nelse if (cur->_val < key)
\ncur = cur->_right;
\nelse
\nreturn false;
\n}
\nNode* node = new Node(key);
\nif (parent->_val > key)
\nparent->_left = node;
\nelse
\nparent->_right = node;
\nreturn true;
\n}
\n}<\/p>\n
\nvoid BSTree<K>::Destroy(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nDestroy(root->_left);
\nDestroy(root->_right);
\ndelete root;
\n}<\/p>\n
\nvoid BSTree<K>::Print()
\n{
\nPrint(_root);
\n}<\/p>\n
\nvoid BSTree<K>::Print(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nPrint(root->_left);
\nstd::cout << root->_val << " ";
\nPrint(root->_right);
\n}<\/p>\n
\nbool BSTree<K>::find(const K& key)
\n{
\nif (_root == nullptr)
\nreturn false;
\nNode* cur = _root;
\nwhile (cur)
\n{
\nif (cur->_val > key)
\ncur = cur->_left;
\nelse if (cur->_val < key)
\ncur = cur->_right;
\nelse
\nreturn true;
\n}
\nreturn false;
\n}<\/p>\n
\nbool BSTree<K>::erase(const K& key)
\n{
\nif (_root == nullptr)
\nreturn false;
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nif (cur->_val > key)
\n{
\nparent = cur;
\ncur = cur->_left;
\n}
\nelse if (cur->_val < key)
\n{
\nparent = cur;
\ncur = cur->_right;
\n}
\nelse
\n{
\nif (cur->_left == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_right;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_right;
\nelse
\nparent->_left = cur->_right;
\n}
\ndelete cur;
\n}
\nelse if (cur->_right == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_left;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_left;
\nelse
\nparent->_left = cur->_left;
\n}
\ndelete cur;
\n}
\nelse
\n{
\nNode* sparent = cur;
\nNode* scur = cur->_right;
\nwhile (scur->_left)
\n{
\nsparent = scur;
\nscur = scur->_left;
\n}
\ncur->_val = scur->_val;
\nif (sparent == cur)
\nsparent->_right = scur->_right;
\nelse
\nsparent->_left = scur->_right;
\ndelete scur;
\nbreak;
\n}
\nreturn true;
\n}
\n}
\nreturn false;
\n}<\/p>\n
\ntypename BSTree<K>::Node* BSTree<K>::Creat(Node* root)
\n{
\nif (root == nullptr)
\nreturn nullptr;
\nNode* cur = new Node(root->_val);
\ncur->_left = Creat(root->_left);
\ncur->_right = Creat(root->_right);
\nreturn cur;
\n}<\/p>\n
\nBSTree<K>& BSTree<K>::operator=(BSTree<K> bst)
\n{
\nstd::swap(_root, bst._root);
\nreturn *this;
\n}<\/p>\n
\n7.\u4e8c\u53c9\u641c\u7d22\u6811key\u548ckey\/value\u4f7f\u7528\u573a\u666f<\/h2>\n
7.1.key\u641c\u7d22\u573a\u666f（\u5bf9\u5e94set\u5bb9\u5668）<\/h3>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154124-6a75fca431420.png\")
<\/p>\n7.2.key\/value\u641c\u7d22\u573a\u666f（\u5bf9\u5e94map\u5bb9\u5668）<\/h3>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154124-6a75fca450014.png\")
<\/p>\n7.3.key\/value\u4e8c\u53c9\u641c\u7d22\u6811\u4ee3\u7801\u5b9e\u73b0<\/h3>\n
\n{
\ntemplate<class K,class V>
\nclass BSTNode
\n{
\npublic:
\nBSTNode() = default;
\nBSTNode(const K& key, const V& value)
\n:_key(key)
\n,_value(value)
\n, _left(nullptr)
\n, _right(nullptr)
\n{<\/p>\n
\nV _value;
\nBSTNode<K, V>* _left = nullptr;
\nBSTNode<K, V>* _right = nullptr;
\n};
\n\/\/<\/p>\n
\nclass BSTree
\n{
\nusing Node = BSTNode<K, V>;<\/p>\n
\npublic:
\nbool insert(const K& key, const V& value);
\nNode* find(const K& key);
\nbool erase(const K& key);
\nvoid Print();
\nBSTree<K,V>& operator=(BSTree<K,V> bst);<\/p>\n
\n{
\n_root = Creat(bst._root);
\n}<\/p>\n
\n{
\nDestroy(_root);
\n}<\/p>\n
\nNode* Creat(Node* root);
\nvoid Print(Node* root);
\nvoid Destroy(Node* root);
\nNode* _root = nullptr;
\n};<\/p>\n
\nbool BSTree<K,V>::insert(const K& key, const V& value)
\n{
\nif (_root == nullptr)
\n{
\nNode* node = new Node(key, value);
\n_root = node;
\nreturn true;
\n}
\nelse
\n{
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nparent = cur;
\nif (cur->_key > key)
\ncur = cur->_left;
\nelse if (cur->_key < key)
\ncur = cur->_right;
\nelse
\nreturn false;
\n}
\nNode* node = new Node(key, value);
\nif (parent->_key > key)
\nparent->_left = node;
\nelse
\nparent->_right = node;
\nreturn true;
\n}
\n}<\/p>\n
\nvoid BSTree<K, V>::Destroy(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nDestroy(root->_left);
\nDestroy(root->_right);
\ndelete root;
\n}<\/p>\n
\nvoid BSTree<K, V>::Print()
\n{
\nPrint(_root);
\n}<\/p>\n
\nvoid BSTree<K, V>::Print(Node* root)
\n{
\nif (root == nullptr)
\nreturn;
\nPrint(root->_left);
\nstd::cout << root->_key << "->" << root->_value << " ";
\nPrint(root->_right);
\n}<\/p>\n
\ntypename BSTree<K, V>::Node* BSTree<K, V>::find(const K& key)
\n{
\nif (_root == nullptr)
\nreturn nullptr;
\nNode* cur = _root;
\nwhile (cur)
\n{
\nif (cur->_key > key)
\ncur = cur->_left;
\nelse if (cur->_key < key)
\ncur = cur->_right;
\nelse
\nreturn cur;
\n}
\nreturn nullptr;
\n}<\/p>\n
\nbool BSTree<K, V>::erase(const K& key)
\n{
\nif (_root == nullptr)
\nreturn false;
\nNode* cur = _root;
\nNode* parent = nullptr;
\nwhile (cur)
\n{
\nif (cur->_key > key)
\n{
\nparent = cur;
\ncur = cur->_left;
\n}
\nelse if (cur->_key < key)
\n{
\nparent = cur;
\ncur = cur->_right;
\n}
\nelse
\n{
\nif (cur->_left == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_right;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_right;
\nelse
\nparent->_left = cur->_right;
\n}
\ndelete cur;
\n}
\nelse if (cur->_right == nullptr)
\n{
\nif (cur == _root)
\n{
\n_root = cur->_left;
\n}
\nelse
\n{
\nif (parent->_right == cur)
\nparent->_right = cur->_left;
\nelse
\nparent->_left = cur->_left;
\n}
\ndelete cur;
\n}
\nelse
\n{
\nNode* sparent = cur;
\nNode* scur = cur->_right;
\nwhile (scur->_left)
\n{
\nsparent = scur;
\nscur = scur->_left;
\n}
\ncur->_key = scur->_key;
\ncur->_value = scur->_value;
\nif (sparent == cur)
\nsparent->_right = scur->_right;
\nelse
\nsparent->_left = scur->_right;
\ndelete scur;
\nbreak;
\n}
\nreturn true;
\n}
\n}
\nreturn false;
\n}<\/p>\n
\ntypename BSTree<K, V>::Node* BSTree<K, V>::Creat(Node* root)
\n{
\nif (root == nullptr)
\nreturn nullptr;
\nNode* cur = new Node(root->_key, root->_value);
\ncur->_left = Creat(root->_left);
\ncur->_right = Creat(root->_right);
\nreturn cur;
\n}<\/p>\n
\nBSTree<K, V>& BSTree<K, V>::operator=(BSTree<K, V> bst)
\n{
\nstd::swap(_root, bst._root);
\nreturn *this;
\n}
\n} <\/p>\n
\n#include "Binary Search Tree.h"
\n#include <string>
\nusing namespace std;
\nint main()
\n{
\nkey_value::BSTree<string, string> dict;
\ndict.insert("left", "\u5de6\u8fb9");
\ndict.insert("right", "\u53f3\u8fb9");
\ndict.insert("insert", "\u63d2\u5165");
\ndict.insert("string", "\u5b57\u7b26\u4e32");
\nstring str;
\nwhile (cin >> str)
\n{
\nauto ret = dict.find(str);
\nif (ret)
\n{
\ncout << "->" << ret->_value << endl;
\n}
\nelse
\n{
\ncout << "\u65e0\u6b64\u5355\u8bcd，\u8bf7\u91cd\u65b0\u8f93\u5165" << endl;
\n}
\n}
\nreturn 0;
\n}
\n#define _CRT_SECURE_NO_WARNINGS
\n#include "Binary Search Tree.h"
\n#include <string>
\nusing namespace std;<\/p>\n
\n{
\nstring arr[] = { "\u82f9\u679c", "\u897f\u74dc", "\u82f9\u679c", "\u897f\u74dc", "\u82f9\u679c", "\u82f9\u679c", "\u897f\u74dc", "\u82f9\u679c", "\u9999\u8549", "\u82f9\u679c", "\u9999\u8549" };
\nkey_value::BSTree<string, int> countTree;
\nfor (const auto& str : arr)
\n{
\n\/\/ \u5148\u67e5\u627e\u2f54\u679c\u5728\u4e0d\u5728\u641c\u7d22\u6811\u4e2d
\n\/\/ 1\u3001\u4e0d\u5728，\u8bf4\u660e\u2f54\u679c\u7b2c\u2f00\u6b21\u51fa\u73b0，\u5219\u63d2\u2f0a<\u2f54\u679c, 1>
\n\/\/ 2\u3001\u5728，\u5219\u67e5\u627e\u5230\u7684\u7ed3\u70b9\u4e2d\u2f54\u679c\u5bf9\u5e94\u7684\u6b21\u6570++
\n\/\/BSTreeNode<string, int>* ret = countTree.Find(str);
\nauto ret = countTree.find(str);
\nif (ret == NULL)
\n{
\ncountTree.insert(str, 1);
\n}
\nelse
\n{
\nret->_value++;
\n}
\n}
\ncountTree.Print();
\nreturn 0;
\n} <\/p>\n
\n\u7ed3\u8bed：<\/h2>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260807154124-6a75fca471222.png\")
<\/p><\/p>\n","protected":false},"excerpt":{"rendered":"
\n\u5f15\u8a00：
\n1.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6982\u5ff5
\n2.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6027\u80fd\u5206\u6790
\n3.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u539f\u7406
\n4.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u67e5\u627e\u539f\u7406
\n5.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5220\u9664\u539f\u7406
\n6.\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5b9e\u73b0
\n6.1.\u6784\u5efa\u521d\u67b6\u6784
\n\u62d3\u5c55：using\u5173\u952e\u5b57
\n6.2.\u63d2\u5165\u5b9e\u73b0（Insert）
\n6.3.\u6790\u6784\u5b9e\u73b0
\n6.4.Print\u5b9e\u73b0（\u6d4b\u8bd5）
\n6.5.\u67e5\u627e\u5b9e\u73b0（find）
\n6.6.\u5220\u9664\u5b9e\u73b0&#<\/p>\n","protected":false},"author":2,"featured_media":91549,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10187,10448,10449,55,190,1813],"topic":[],"class_list":["post-91565","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-codingplan","tag-bst","tag-10449","tag-c","tag-190","tag-1813"],"yoast_head":"\n