Which among the following properties is not satisfied by a B
tree of order m?
(i) keys are stored in the information nodes.
(ii) the depth of an information node in a trie always
depends on the length of the key.
(iii) to access an information node containing a key, we
need to move down a branch node or a series of branch nodes following the
appropriate branch based on the alphabetical characters composing the key.
(iv) a branch node is merely a collection of pointers to
either a branch node or an information node.
(a) (i) (b) (ii) (c) (iii) (d) (iv)