二元搜尋樹 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "二元搜尋樹" in Chinese language version.

refsWebsite

Global rank Chinese rank

17web.archive.org

1^st place

9doi.org

2^nd place

23^rd place

6wikipedia.org

low place

4oup.com

485^th place

489^th place

3semanticscholar.org

11^th place

332^nd place

2cnki.net

3,420^th place

133^rd place

2cornell.edu

332^nd place

526^th place

2princeton.edu

741^st place

907^th place

1edb.gov.hk

low place

757^th place

1springer.com

274^th place

320^th place

1nist.gov

355^th place

411^th place

1toronto.edu

low place

1zhjwpku.com

low place

1mit.edu

415^th place

500^th place

1uta.edu

low place

8,968^th place

1lmu.edu

9,212^th place

low place

1uci.edu

3,063^rd place

5,629^th place

1cambridge.org

305^th place

511^th place

1uni-saarland.de

low place

1ghostarchive.org

32^nd place

657^th place

1archive.org

6^th place

4^th place

1worldcat.org

5^th place

12^th place

1cmu.edu

1,564^th place

1,640^th place

1emory.edu

4,363^rd place

4,754^th place

archive.org

Lehman, Tobin J.; Carey, Michael J. A Study of Index Structures for Main Memory Database Management Systems. Twelfth International Conference on Very Large Databases (VLDB 1986). Kyoto. 1986-08. ISBN 0-934613-18-4 （英语）.

cambridge.org

Brass, Peter. Advanced Data Structure. Cambridge University Press. 2011-01 [2025-05-11]. ISBN 9780511800191. doi:10.1017/CBO9780511800191. （原始内容存档于2025-05-09）（英语）.

cmu.edu

cs.cmu.edu

Sleator, Daniel D.; Tarjan, Robert E. Self-Adjusting Binary Search Trees (PDF). Journal of the ACM. 1985, 32 (3): 652–686. S2CID 1165848. doi:10.1145/3828.3835 （英语）.

cnki.net

kns.cnki.net

吴海辉; 吴建国. 一种基于有序二叉树的高效优化索引树. 微机发展. 2004, (4): 18–21,24. CNKI WJFZ200404006 （中文（中国大陆））.
王雅琳; 肖媛; 雷友诚; 桂卫华. 基于排序二叉树的摘挂列车编组钩计划自动编制方法. 中国铁道科学. 2012, 33 (3): 116–122. CNKI ZGTK201203020 （中文（中国大陆））.

cornell.edu

cs.cornell.edu

Myers, Andrew. CS 312 Lecture: AVL Trees. Cornell University, Department of Computer Science. [2022-05-19]. （原始内容存档于2021-04-27）（英语）.
Myers, Andrew. CS 2112 Lecture and Recitation Notes: Priority Queues and Heaps. Cornell University, Department of Computer Science. [2021-10-21]. （原始内容存档于2021-10-21）（英语）.

doi.org

Culberson, J.; Munro, J. I. Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal（英语：The Computer Journal）. 1989-01-01, 32 (1): 68–69 [2025-05-11]. doi:10.1093/comjnl/32.1.68 . （原始内容存档于2023-08-23）（英语）.
Culberson, J.; Munro, J. I. Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica（英语：Algorithmica） (Springer Publishing（英语：Springer Publishing）, University of Waterloo). 1986-07-28, 5 (1–4): 297 [2025-05-11]. S2CID 971813. doi:10.1007/BF01840390. （原始内容存档于2023-10-23）（英语）.
P. F. Windley. Trees, Forests and Rearranging. The Computer Journal（英语：The Computer Journal）. 1960-01-01, 3 (2): 84. doi:10.1093/comjnl/3.2.84  （英语）.
R. A. Frost; M. M. Peterson. A Short Note on Binary Search Trees. The Computer Journal（英语：The Computer Journal） (Oxford University Press). 1982-02-01, 25 (1): 158. doi:10.1093/comjnl/25.1.158 （英语）.
Brass, Peter. Advanced Data Structure. Cambridge University Press. 2011-01 [2025-05-11]. ISBN 9780511800191. doi:10.1017/CBO9780511800191. （原始内容存档于2025-05-09）（英语）.
Blum, Norbert; Mehlhorn, Kurt. On the Average Number of Rebalancing Operations in Weight-Balanced Trees (PDF). Theoretical Computer Science. 1978, 11 (3): 303–320. doi:10.1016/0304-3975(80)90018-3. （原始内容存档 (PDF)于2022-10-09）（英语）.
Aragon, Cecilia R.; Seidel, Raimund. 30th Annual Symposium on Foundations of Computer Science. Washington, D.C.: IEEE Computer Society Press: 540–545. 1989. ISBN 0-8186-1982-1. doi:10.1109/SFCS.1989.63531 （英语）.
Comer, Douglas. The Ubiquitous B-Tree. Computing Surveys. 1979-06, 11 (2): 123–137. ISSN 0360-0300. S2CID 101673. doi:10.1145/356770.356776  （英语）.
Sleator, Daniel D.; Tarjan, Robert E. Self-Adjusting Binary Search Trees (PDF). Journal of the ACM. 1985, 32 (3): 652–686. S2CID 1165848. doi:10.1145/3828.3835 （英语）.

edb.gov.hk

香港特別行政區政府教育局課程發展處科技教育組. 中學資訊及通訊科技科常用英漢辭彙 (PDF). 中華人民共和國香港特別行政區教育局: 7. 2023-01 [2025-05-18]. （原始内容存档 (PDF)于2025-04-09）（中文（香港））.

emory.edu

mathcenter.oxford.emory.edu

Xiong, Li. A Connection Between Binary Search Trees and Quicksort. Oxford College of Emory University, The Department of Mathematics and Computer Science. [2022-06-04]. （原始内容存档于2021-02-26）（英语）.

ghostarchive.org

Blum, Norbert; Mehlhorn, Kurt. On the Average Number of Rebalancing Operations in Weight-Balanced Trees (PDF). Theoretical Computer Science. 1978, 11 (3): 303–320. doi:10.1016/0304-3975(80)90018-3. （原始内容存档 (PDF)于2022-10-09）（英语）.

lmu.edu

cs.lmu.edu

Ray, Ray. Binary Search Tree. Loyola Marymount University, Department of Computer Science. [2022-05-17]. （原始内容存档于2024-03-24）（英语）.

mit.edu

mitpress.mit.edu

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms 2nd. MIT Press. 2001 [2025-05-11]. ISBN 0-262-03293-7. （原始内容存档于2022-06-24）（英语）.

nist.gov

Black, Paul E. Paul E. Black , 编. red-black tree. Dictionary of Algorithms and Data Structures. 2019-11-12 [2022-05-19]. （原始内容存档于2009-01-23）（英语）.

oup.com

academic.oup.com

Culberson, J.; Munro, J. I. Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal（英语：The Computer Journal）. 1989-01-01, 32 (1): 68–69 [2025-05-11]. doi:10.1093/comjnl/32.1.68 . （原始内容存档于2023-08-23）（英语）.
P. F. Windley. Trees, Forests and Rearranging. The Computer Journal（英语：The Computer Journal）. 1960-01-01, 3 (2): 84. doi:10.1093/comjnl/3.2.84  （英语）.
R. A. Frost; M. M. Peterson. A Short Note on Binary Search Trees. The Computer Journal（英语：The Computer Journal） (Oxford University Press). 1982-02-01, 25 (1): 158. doi:10.1093/comjnl/25.1.158 （英语）.

global.oup.com

Thareja, Reema. Hashing and Collision. Data Structures Using C 2. Oxford University Press. 2018-10-13 [2025-05-11]. ISBN 9780198099307. （原始内容存档于2025-05-09）（英语）.

princeton.edu

algs4.cs.princeton.edu

Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2025-05-11]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）（英语）. Condensed web version ; book version .

cs.princeton.edu

Narayanan, Arvind. COS226: Binary search trees. Princeton University School of Engineering and Applied Science（英语：Princeton University School of Engineering and Applied Science）. 2019 [2021-10-21]. （原始内容存档于2021-03-22） –通过cs.princeton.edu （英语）.

semanticscholar.org

api.semanticscholar.org

Culberson, J.; Munro, J. I. Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica（英语：Algorithmica） (Springer Publishing（英语：Springer Publishing）, University of Waterloo). 1986-07-28, 5 (1–4): 297 [2025-05-11]. S2CID 971813. doi:10.1007/BF01840390. （原始内容存档于2023-10-23）（英语）.
Comer, Douglas. The Ubiquitous B-Tree. Computing Surveys. 1979-06, 11 (2): 123–137. ISSN 0360-0300. S2CID 101673. doi:10.1145/356770.356776  （英语）.
Sleator, Daniel D.; Tarjan, Robert E. Self-Adjusting Binary Search Trees (PDF). Journal of the ACM. 1985, 32 (3): 652–686. S2CID 1165848. doi:10.1145/3828.3835 （英语）.

springer.com

link.springer.com

Culberson, J.; Munro, J. I. Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica（英语：Algorithmica） (Springer Publishing（英语：Springer Publishing）, University of Waterloo). 1986-07-28, 5 (1–4): 297 [2025-05-11]. S2CID 971813. doi:10.1007/BF01840390. （原始内容存档于2023-10-23）（英语）.

toronto.edu

cs.toronto.edu

Pitassi, Toniann. CSC263: Balanced BSTs, AVL tree (PDF). University of Toronto, Department of Computer Science: 6. 2015 [2022-05-19]. （原始内容存档 (PDF)于2019-02-14）（英语）.

uci.edu

ics.uci.edu

Thornton, Alex. ICS 46: Binary Search Trees. University of California, Irvine. 2021 [2021-10-21]. （原始内容存档于2021-07-04）（英语）.

uni-saarland.de

scidok.sulb.uni-saarland.de

Blum, Norbert; Mehlhorn, Kurt. On the Average Number of Rebalancing Operations in Weight-Balanced Trees (PDF). Theoretical Computer Science. 1978, 11 (3): 303–320. doi:10.1016/0304-3975(80)90018-3. （原始内容存档 (PDF)于2022-10-09）（英语）.

uta.edu

ranger.uta.edu

Junzhou Huang. Design and Analysis of Algorithms (PDF). University of Texas at Arlington: 12. [2021-05-17]. （原始内容存档 (PDF)于2021-04-13）（英语）.

web.archive.org

香港特別行政區政府教育局課程發展處科技教育組. 中學資訊及通訊科技科常用英漢辭彙 (PDF). 中華人民共和國香港特別行政區教育局: 7. 2023-01 [2025-05-18]. （原始内容存档 (PDF)于2025-04-09）（中文（香港））.
Culberson, J.; Munro, J. I. Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal（英语：The Computer Journal）. 1989-01-01, 32 (1): 68–69 [2025-05-11]. doi:10.1093/comjnl/32.1.68 . （原始内容存档于2023-08-23）（英语）.
Culberson, J.; Munro, J. I. Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica（英语：Algorithmica） (Springer Publishing（英语：Springer Publishing）, University of Waterloo). 1986-07-28, 5 (1–4): 297 [2025-05-11]. S2CID 971813. doi:10.1007/BF01840390. （原始内容存档于2023-10-23）（英语）.
Black, Paul E. Paul E. Black , 编. red-black tree. Dictionary of Algorithms and Data Structures. 2019-11-12 [2022-05-19]. （原始内容存档于2009-01-23）（英语）.
Pitassi, Toniann. CSC263: Balanced BSTs, AVL tree (PDF). University of Toronto, Department of Computer Science: 6. 2015 [2022-05-19]. （原始内容存档 (PDF)于2019-02-14）（英语）.
Myers, Andrew. CS 312 Lecture: AVL Trees. Cornell University, Department of Computer Science. [2022-05-19]. （原始内容存档于2021-04-27）（英语）.
Adelson-Velsky, Georgy; Landis, Evgenii. An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences（英语：Proceedings of the USSR Academy of Sciences）. 1962, 146: 263–266 （俄语）. English translation （页面存档备份，存于互联网档案馆） by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.
Thareja, Reema. Hashing and Collision. Data Structures Using C 2. Oxford University Press. 2018-10-13 [2025-05-11]. ISBN 9780198099307. （原始内容存档于2025-05-09）（英语）.
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms 2nd. MIT Press. 2001 [2025-05-11]. ISBN 0-262-03293-7. （原始内容存档于2022-06-24）（英语）.
Sedgewick, Robert; Wayne, Kevin. Algorithms 4th. Upper Saddle River, New Jersey: Addison-Wesley Professional. 2011 [2025-05-11]. ISBN 978-0-321-57351-3. （原始内容存档于2014-07-15）（英语）. Condensed web version ; book version .
Junzhou Huang. Design and Analysis of Algorithms (PDF). University of Texas at Arlington: 12. [2021-05-17]. （原始内容存档 (PDF)于2021-04-13）（英语）.
Ray, Ray. Binary Search Tree. Loyola Marymount University, Department of Computer Science. [2022-05-17]. （原始内容存档于2024-03-24）（英语）.
Thornton, Alex. ICS 46: Binary Search Trees. University of California, Irvine. 2021 [2021-10-21]. （原始内容存档于2021-07-04）（英语）.
Brass, Peter. Advanced Data Structure. Cambridge University Press. 2011-01 [2025-05-11]. ISBN 9780511800191. doi:10.1017/CBO9780511800191. （原始内容存档于2025-05-09）（英语）.
Narayanan, Arvind. COS226: Binary search trees. Princeton University School of Engineering and Applied Science（英语：Princeton University School of Engineering and Applied Science）. 2019 [2021-10-21]. （原始内容存档于2021-03-22） –通过cs.princeton.edu （英语）.
Xiong, Li. A Connection Between Binary Search Trees and Quicksort. Oxford College of Emory University, The Department of Mathematics and Computer Science. [2022-06-04]. （原始内容存档于2021-02-26）（英语）.
Myers, Andrew. CS 2112 Lecture and Recitation Notes: Priority Queues and Heaps. Cornell University, Department of Computer Science. [2021-10-21]. （原始内容存档于2021-10-21）（英语）.

wikipedia.org

en.wikipedia.org

Culberson, J.; Munro, J. I. Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal（英语：The Computer Journal）. 1989-01-01, 32 (1): 68–69 [2025-05-11]. doi:10.1093/comjnl/32.1.68 . （原始内容存档于2023-08-23）（英语）.
Culberson, J.; Munro, J. I. Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica（英语：Algorithmica） (Springer Publishing（英语：Springer Publishing）, University of Waterloo). 1986-07-28, 5 (1–4): 297 [2025-05-11]. S2CID 971813. doi:10.1007/BF01840390. （原始内容存档于2023-10-23）（英语）.
P. F. Windley. Trees, Forests and Rearranging. The Computer Journal（英语：The Computer Journal）. 1960-01-01, 3 (2): 84. doi:10.1093/comjnl/3.2.84  （英语）.
Adelson-Velsky, Georgy; Landis, Evgenii. An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences（英语：Proceedings of the USSR Academy of Sciences）. 1962, 146: 263–266 （俄语）. English translation （页面存档备份，存于互联网档案馆） by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.
R. A. Frost; M. M. Peterson. A Short Note on Binary Search Trees. The Computer Journal（英语：The Computer Journal） (Oxford University Press). 1982-02-01, 25 (1): 158. doi:10.1093/comjnl/25.1.158 （英语）.
Narayanan, Arvind. COS226: Binary search trees. Princeton University School of Engineering and Applied Science（英语：Princeton University School of Engineering and Applied Science）. 2019 [2021-10-21]. （原始内容存档于2021-03-22） –通过cs.princeton.edu （英语）.

worldcat.org

Comer, Douglas. The Ubiquitous B-Tree. Computing Surveys. 1979-06, 11 (2): 123–137. ISSN 0360-0300. S2CID 101673. doi:10.1145/356770.356776  （英语）.

zhjwpku.com

Adelson-Velsky, Georgy; Landis, Evgenii. An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences（英语：Proceedings of the USSR Academy of Sciences）. 1962, 146: 263–266 （俄语）. English translation （页面存档备份，存于互联网档案馆） by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.