News for hackers. Stuff that matters.
Re:CLRS and Knuth disagree in the definition of “complete k-... by Ferrotin on Saturday April 09, 2022 @10:25PM (#30973947)
The good news is, a “complete K-ary tree with N nodes” is unambiguous.

> One consequence is that the Knuth definition allows leaves at different depths. For example, a tree with two nodes: one root and a child

But that only has one leaf.

Re:CLRS and Knuth disagree in the definition of “complete k-... by xdavidliu on Sunday April 10, 2022 @12:20AM (#30974450)
yes, one leaf satisfies Knuth's definition: it has all levels full (the root) except for possibly the last (the leaf).
Re:CLRS and Knuth disagree in the definition of “complete k-... by Ferrotin on Sunday April 10, 2022 @01:10AM (#30974627)
I’m saying, that’s not an example of leaves on different levels.