deb http://mirrors.163.com/debian/ bookworm main contrib non-free non-free-firmware
deb http://mirrors.163.com/debian/ bookworm-updates main contrib non-free non-free-firmware
deb http://mirrors.163.com/debian/ bookworm-backports main contrib non-free non-free-firmware
deb http://mirrors.163.com/debian-security/ bookworm-security main contrib non-free non-free-firmware
四、假设不使用一棵叠加的度为 u \sqrt{u} u 的树,而是使用一棵叠加的度为 u 1 k u^{\frac{1}{k}} uk1的树,这里 k 是大于 1 的常数,则这样的一棵树的高度是多少?又每个操作将需要多长时间?如果要写代码…