Complete Binary Tree
المؤلف:
Knuth, D. E.
المصدر:
The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997.
الجزء والصفحة:
...
20-5-2022
3717
Complete Binary Tree
A labeled binary tree containing the labels 1 to 
with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so on (Knuth 1997, p. 401). The graph corresponding to the complete binary tree on 
nodes is implemented in the Wolfram Language as KaryTree[n, 2].
REFERENCES
Knuth, D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997.
Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, p. 144, 1998.
الاكثر قراءة في نظرية البيان
اخر الاخبار
اخبار العتبة العباسية المقدسة
