请翻译：Prove, by induction on k, that level k of a binary tree has less than or equal to 2k nodes (root...

请证明，通过对 k 的归纳，二叉树的第 k 层有不多于 2^k 个节点(根节点的层级为 k=0)。