題目描述You are given a binary search tree with depth k, whose nodes are valued from 1 to (2k − 1) and then Q queries.
確定! 回上一頁