单选

在一棵完全二叉树中,其根的序号为1,(31)可判定序号为p和q的两个结点是否在同一层。

  • A.[log2p]=[log2p]
  • B.log2p=log2q
  • C.[log2p]+1=[log2p]
  • D.[log2p]=[log2p]+1
参考答案
您可能感兴趣的试题

(74)

  • A.clock pulse
  • B.instruction
  • C.memory access
  • D.machine cycle

(73)

  • A.E-time
  • B.I-time
  • C.cycle time
  • D.run time

(72)

  • A.E-time
  • B.I-time
  • C.cycle time
  • D.run time

(69)

  • A.receive
  • B.be received
  • C.receiving
  • D.received

(71)

  • A.address
  • B.value
  • C.content
  • D.register

(68)

  • A.full
  • B.empty
  • C.zero
  • D.blank

(67)

  • A.off
  • B.on
  • C.up
  • D.down

(66)

  • A.takes
  • B.operates
  • C.erases
  • D.holds
¥

订单号:

遇到问题请联系在线客服

订单号:

遇到问题请联系在线客服