Archibald, M., & Clément, J. (2006, January). Average depth in a binary search tree with repeated keys. Discrete Mathematics & Theoretical Computer Science.
Chicago Style (17th ed.) CitationArchibald, Margaret, and Julien Clément. "Average Depth in a Binary Search Tree with Repeated Keys." Discrete Mathematics & Theoretical Computer Science Jan. 2006.
MLA引文Archibald, Margaret, and Julien Clément. "Average Depth in a Binary Search Tree with Repeated Keys." Discrete Mathematics & Theoretical Computer Science, Jan. 2006.
警告:這些引文格式不一定是100%准確.
