（有翻译）1. The O-notation provides an asymptotic upper bound. The W-notation provides an asymptotic lower bound. The -notation asymptotically a function form above and below. O型符号提供一个渐近的上限。符号提供一个渐近下界。-符号渐近函数形式的上方和下方。2. To represent a heap as an array，the root of tree is A1, and given the index i of a node, the indices of its parent Parent(i) return i/2; ，left child, Left(i) return 2*i; ，right child, right(i) return 2*i + 1; .代表一个堆中的一个数组，树的根节点是A1，并且给出一个节点i，那么该节点的父节点是
