Binary search tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Binary search tree" in English language version.

Last modified: 02:31:31, 17 October 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

151mit.edu

476^th place

340^th place

149doi.org

2^nd place

77web.archive.org

1^st place

64oup.com

292^nd place

233^rd place

51cambridge.org

209^th place

151^st place

43archive.org

6^th place

43ghostarchive.org

64^th place

28^th place

33semanticscholar.org

15^th place

8^th place

22cornell.edu

308^th place

253^rd place

11toronto.edu

low place

11zhjwpku.com

low place

11springer.com

182^nd place

172^nd place

11nist.gov

708^th place

742^nd place

11uta.edu

low place

6,309^th place

11lmu.edu

low place

8,909^th place

11uci.edu

4,152^nd place

2,592^nd place

11uni-saarland.de

low place

11washington.edu

1,171^st place

736^th place

11worldcat.org

4^th place

11cmu.edu

2,125^th place

1,347^th place

11princeton.edu

802^nd place

528^th place

11emory.edu

4,285^th place

2,560^th place

archive.org (Global: 6^th place; English: 6^th place)

Knuth, Donald (1998). "Section 6.2.3: Balanced Trees". The Art of Computer Programming. Vol. 3 (2 ed.). Addison-Wesley. pp. 458–481. ISBN 978-0201896855. Archived from the original on 2022-10-09.
Lehman, Tobin J.; Carey, Michael J. (25–28 August 1986). A Study of Index Structures for Main Memory Database Management Systems. Twelfth International Conference on Very Large Databases (VLDB 1986). Kyoto. ISBN 0-934613-18-4.
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Red–Black Trees". Introduction to Algorithms (second ed.). MIT Press. pp. 273–301. ISBN 978-0-262-03293-3.

cambridge.org (Global: 209^th place; English: 151^st place)

Brass, Peter (January 2011). Advanced Data Structure. Cambridge University Press. doi:10.1017/CBO9780511800191. ISBN 9780511800191.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

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

cornell.edu (Global: 308^th place; English: 253^rd place)

cs.cornell.edu

Myers, Andrew. "CS 312 Lecture: AVL Trees". Cornell University, Department of Computer Science. Archived from the original on 27 April 2021. Retrieved 19 May 2022.
Myers, Andrew. "CS 2112 Lecture and Recitation Notes: Priority Queues and Heaps". Cornell University, Department of Computer Science. Archived from the original on 21 October 2021. Retrieved 21 October 2021.

doi.org (Global: 2^nd place; English: 2^nd place)

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

emory.edu (Global: 4,285^th place; English: 2,560^th place)

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. Archived from the original on 26 February 2021. Retrieved 4 June 2022.

ghostarchive.org (Global: 64^th place; English: 28^th place)

Knuth, Donald (1998). "Section 6.2.3: Balanced Trees". The Art of Computer Programming. Vol. 3 (2 ed.). Addison-Wesley. pp. 458–481. ISBN 978-0201896855. Archived from the original on 2022-10-09.
Blum, Norbert; Mehlhorn, Kurt (1978). "On the Average Number of Rebalancing Operations in Weight-Balanced Trees" (PDF). Theoretical Computer Science. 11 (3): 303–320. doi:10.1016/0304-3975(80)90018-3. Archived (PDF) from the original on 2022-10-09.
Aragon, Cecilia R.; Seidel, Raimund (1989), "Randomized Search Trees" (PDF), 30th Annual Symposium on Foundations of Computer Science, Washington, D.C.: IEEE Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1, archived (PDF) from the original on 2022-10-09

lmu.edu (Global: low place; English: 8,909^th place)

cs.lmu.edu

Ray, Ray. "Binary Search Tree". Loyola Marymount University, Department of Computer Science. Retrieved 17 May 2022.

mit.edu (Global: 476^th place; English: 340^th place)

mitpress.mit.edu

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (2nd ed.). MIT Press. ISBN 0-262-03293-7.

nist.gov (Global: 708^th place; English: 742^nd place)

Paul E. Black, "red-black tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 November 2019. (accessed May 19 2022) from: https://www.nist.gov/dads/HTML/redblack.html

oup.com (Global: 292^nd place; English: 233^rd place)

academic.oup.com

Culberson, J.; Munro, J. I. (1 January 1989). "Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations". The Computer Journal. 32 (1): 68–69. doi:10.1093/comjnl/32.1.68.
P. F. Windley (1 January 1960). "Trees, Forests and Rearranging". The Computer Journal. 3 (2): 84. doi:10.1093/comjnl/3.2.84.
R. A. Frost; M. M. Peterson (1 February 1982). "A Short Note on Binary Search Trees". The Computer Journal. 25 (1). Oxford University Press: 158. doi:10.1093/comjnl/25.1.158.

global.oup.com

Thareja, Reema (13 October 2018). "Hashing and Collision". Data Structures Using C (2 ed.). Oxford University Press. ISBN 9780198099307.

princeton.edu (Global: 802^nd place; English: 528^th place)

cs.princeton.edu

Narayanan, Arvind (2019). "COS226: Binary search trees". Princeton University School of Engineering and Applied Science. Archived from the original on 22 March 2021. Retrieved 21 October 2021 – via cs.princeton.edu.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Culberson, J.; Munro, J. I. (28 July 1986). "Analysis of the standard deletion algorithms in exact fit domain binary search trees". Algorithmica. 5 (1–4). Springer Publishing, University of Waterloo: 297. doi:10.1007/BF01840390. S2CID 971813.
Comer, Douglas (June 1979), "The Ubiquitous B-Tree", Computing Surveys, 11 (2): 123–137, doi:10.1145/356770.356776, ISSN 0360-0300, S2CID 101673
Sleator, Daniel D.; Tarjan, Robert E. (1985). "Self-Adjusting Binary Search Trees" (PDF). Journal of the ACM. 32 (3): 652–686. doi:10.1145/3828.3835. S2CID 1165848.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Culberson, J.; Munro, J. I. (28 July 1986). "Analysis of the standard deletion algorithms in exact fit domain binary search trees". Algorithmica. 5 (1–4). Springer Publishing, University of Waterloo: 297. doi:10.1007/BF01840390. S2CID 971813.

toronto.edu (Global: low place; English: low place)

cs.toronto.edu

Pitassi, Toniann (2015). "CSC263: Balanced BSTs, AVL tree" (PDF). University of Toronto, Department of Computer Science. p. 6. Archived (PDF) from the original on 14 February 2019. Retrieved 19 May 2022.

uci.edu (Global: 4,152^nd place; English: 2,592^nd place)

ics.uci.edu

Thornton, Alex (2021). "ICS 46: Binary Search Trees". University of California, Irvine. Archived from the original on 4 July 2021. Retrieved 21 October 2021.

uni-saarland.de (Global: low place; English: low place)

scidok.sulb.uni-saarland.de

Blum, Norbert; Mehlhorn, Kurt (1978). "On the Average Number of Rebalancing Operations in Weight-Balanced Trees" (PDF). Theoretical Computer Science. 11 (3): 303–320. doi:10.1016/0304-3975(80)90018-3. Archived (PDF) from the original on 2022-10-09.

uta.edu (Global: low place; English: 6,309^th place)

ranger.uta.edu

Junzhou Huang. "Design and Analysis of Algorithms" (PDF). University of Texas at Arlington. p. 12. Archived (PDF) from the original on 13 April 2021. Retrieved 17 May 2021.

washington.edu (Global: 1,171^st place; English: 736^th place)

faculty.washington.edu

Aragon, Cecilia R.; Seidel, Raimund (1989), "Randomized Search Trees" (PDF), 30th Annual Symposium on Foundations of Computer Science, Washington, D.C.: IEEE Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1, archived (PDF) from the original on 2022-10-09

web.archive.org (Global: 1^st place; English: 1^st place)

Pitassi, Toniann (2015). "CSC263: Balanced BSTs, AVL tree" (PDF). University of Toronto, Department of Computer Science. p. 6. Archived (PDF) from the original on 14 February 2019. Retrieved 19 May 2022.
Myers, Andrew. "CS 312 Lecture: AVL Trees". Cornell University, Department of Computer Science. Archived from the original on 27 April 2021. Retrieved 19 May 2022.
Junzhou Huang. "Design and Analysis of Algorithms" (PDF). University of Texas at Arlington. p. 12. Archived (PDF) from the original on 13 April 2021. Retrieved 17 May 2021.
Thornton, Alex (2021). "ICS 46: Binary Search Trees". University of California, Irvine. Archived from the original on 4 July 2021. Retrieved 21 October 2021.
Narayanan, Arvind (2019). "COS226: Binary search trees". Princeton University School of Engineering and Applied Science. Archived from the original on 22 March 2021. Retrieved 21 October 2021 – via 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. Archived from the original on 26 February 2021. Retrieved 4 June 2022.
Myers, Andrew. "CS 2112 Lecture and Recitation Notes: Priority Queues and Heaps". Cornell University, Department of Computer Science. Archived from the original on 21 October 2021. Retrieved 21 October 2021.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Comer, Douglas (June 1979), "The Ubiquitous B-Tree", Computing Surveys, 11 (2): 123–137, doi:10.1145/356770.356776, ISSN 0360-0300, S2CID 101673

zhjwpku.com (Global: low place; English: low place)

Adelson-Velsky, Georgy; Landis, Evgenii (1962). "An algorithm for the organization of information". Proceedings of the USSR Academy of Sciences (in Russian). 146: 263–266. English translation by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.

Binary search tree (English Wikipedia)

archive.org (Global: 6th place; English: 6th place)

cambridge.org (Global: 209th place; English: 151st place)

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

cornell.edu (Global: 308th place; English: 253rd place)

cs.cornell.edu

doi.org (Global: 2nd place; English: 2nd place)

emory.edu (Global: 4,285th place; English: 2,560th place)

mathcenter.oxford.emory.edu

ghostarchive.org (Global: 64th place; English: 28th place)

lmu.edu (Global: low place; English: 8,909th place)

cs.lmu.edu

mit.edu (Global: 476th place; English: 340th place)

mitpress.mit.edu

nist.gov (Global: 708th place; English: 742nd place)

oup.com (Global: 292nd place; English: 233rd place)

academic.oup.com

global.oup.com

princeton.edu (Global: 802nd place; English: 528th place)

cs.princeton.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 182nd place; English: 172nd place)

link.springer.com

toronto.edu (Global: low place; English: low place)

cs.toronto.edu

uci.edu (Global: 4,152nd place; English: 2,592nd place)

ics.uci.edu

uni-saarland.de (Global: low place; English: low place)

scidok.sulb.uni-saarland.de

uta.edu (Global: low place; English: 6,309th place)

ranger.uta.edu

washington.edu (Global: 1,171st place; English: 736th place)

faculty.washington.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

zhjwpku.com (Global: low place; English: low place)

archive.org (Global: 6^th place; English: 6^th place)

cambridge.org (Global: 209^th place; English: 151^st place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cornell.edu (Global: 308^th place; English: 253^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

emory.edu (Global: 4,285^th place; English: 2,560^th place)

ghostarchive.org (Global: 64^th place; English: 28^th place)

lmu.edu (Global: low place; English: 8,909^th place)

mit.edu (Global: 476^th place; English: 340^th place)

nist.gov (Global: 708^th place; English: 742^nd place)

oup.com (Global: 292^nd place; English: 233^rd place)

princeton.edu (Global: 802^nd place; English: 528^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

springer.com (Global: 182^nd place; English: 172^nd place)

uci.edu (Global: 4,152^nd place; English: 2,592^nd place)

uta.edu (Global: low place; English: 6,309^th place)

washington.edu (Global: 1,171^st place; English: 736^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)