【单选题】【消耗次数:1】
The order came ___ the soldiers ___ the small village the next morning.
that; had to leave
that; should leave
/; must leave
when; should leave
参考答案:
复制
纠错
相关题目
【单选题】 I leave it to your own judgement you should do it.
①  that
②  which
③  whether
④  What
【单选题】 21. — When will you leave for Paris for a visit? — next month.
①  Until
②  After
③  At
④  In
【单选题】 The key ___ on the table when I leave.
①  was left
②  will be left
③  is left
④  has been left
【单选题】 She asked me when I ?[填空] leave.
①  will
②  is going to
③  would
④  should
【单选题】 A: When does the next train for London leave? B: Theres one leaving at 8 oclock. A: [填空]
①  Are you sure?
②  OK. I dont want to be late.
③  Thanks. Could you wait for me?
④  Id like one ticket, please.
【单选题】 7.The key ___ on the table when I leave.
①  was left
②  will be left
③  is left
④  has been left
【单选题】 Helen, if someone comes to see me this morning, ask him to leave a_____. ?
①  word ?
②  notice ?
③  message ?
④  mail ?
【单选题】 They can’t leave until they _________ their work .
①  did
②  are doing
③  have done
④  his done
【单选题】 They can’t leave until they _______ their work .
①  did
②  are doing
③  have done
④  his done
【单选题】 On no account _____ever leave the baby at home alone.
①  should you
②  you should
③  shall you
④  you shall
随机题目
【单选题】 一棵有20个结点采用链式存储的二叉树中,共有( )个指针域为空。
①  A.21
②  B.20
③  C.19
④  D.18
【单选题】 一棵非空的二叉树,先序遍历与后续遍历正好相反,则该二叉树满足( )。
①  A.无左孩子
②  B.无右孩子
③  C.只有一个叶子结点
④  D.任意二叉树
【单选题】 设一棵采用链式存储的二叉树,除叶结点外每个结点度数都为2,该树结点中共有2n个指针域为空。则该树有( )个叶结点。
①  A.2n
②  B.2n+1
③  C.2n+2
④  D.N
【单选题】 在一棵二叉树中,若编号为i的结点是其双亲结点的右孩子,则双亲结点的顺序编号为( )。
①  A.i/2.0
②  B.i/2+1
③  C.2i+1
④  D.i/2向下取整
【单选题】 对线性表进行二分查找时,要求线性表必需( )。
①  A.以顺序方式存储
②  B.以链接方式存储
③  C.以顺序方式存储,且结点按关键字有序排列
④  D.以链接方式存储,且结点按关键字有序排列
【单选题】 设一棵采用链式存储的二叉树,除叶结点外每个结点度数都为2,该树结点中共有20个指针域为空。则该树有( )个叶结点。
①  A.21
②  B.22
③  C.9
④  D.10
【单选题】 一棵完全二叉树共有4层,且第4层上有2个结点,该树共有( )个非叶子结点(根为第一层)。
①  A.5
②  B.4
③  C.3
④  D.9
【单选题】 设a,b为一棵二叉树的两个结点,在后续遍历中,a在b前的条件是( )。
①  A.a在b上方
②  B.a在b下方
③  C.a在b左方
④  D.a在b右方
【单选题】 设一棵哈夫曼树共有2n+1个结点,则该树有( )个非叶结点。
①  A.n
②  B.n+1
③  C.n-1
④  D.2n
【单选题】 权值为{1,2,6,8}的四个结点构成的哈夫曼树的带权路径长度是( )。
①  A.18
②  B.28
③  C.19
④  D.29