Left-child right-sibling binary tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Left-child right-sibling binary tree" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

355^th place

454^th place

1,564^th place

1,028^th place

1stackoverflow.com

4,643^rd place

2,973^rd place

cmu.edu

cs.cmu.edu

Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E. (1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1): 111–129. doi:10.1007/BF01840439.

doi.org

Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E. (1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1): 111–129. doi:10.1007/BF01840439.
Sussenguth, Edward H. (May 1963). "Use of tree structures for processing files". Communications of the ACM. 6 (5): 272–279. doi:10.1145/366552.366600.

nist.gov

xlinux.nist.gov

This article incorporates public domain material from Paul E. Black. "Binary tree representation of trees". Dictionary of Algorithms and Data Structures. NIST.
"binary tree representation of trees". xlinux.nist.gov. Retrieved 2015-11-24.

stackoverflow.com

"What is the left-child, right-sibling representation of a tree? Why would you use it?". stackoverflow.com. Retrieved 2016-12-12.