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