Home > other >  About the complete binary tree with n nodes depth
About the complete binary tree with n nodes depth

Time:10-16

Logm said in the computer science to 2 at the bottom, the logarithm of m

CodePudding user response:

On the last line: [log n] is integer (only integer), down (log n) + 1 is rounded up,
  • Related