// 当前元素入栈：成为「左侧元素」的候选更大值（易错点4：别漏写这一步）
// not critical but safer when bytesToWrite != view.byteLength
。业内人士推荐雷电模拟器官方版本下载作为进阶阅读
// Decode on CPU。业内人士推荐爱思助手下载最新版本作为进阶阅读
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
// Speaker 0: [3.36s - 4.40s]