81) B+- trees are preferred to binary trees in databases because

Disk capacities are greater than memory capacities

Disk access is much slower than memory Access

Disk data transfer rates are much less than memory data transfer rates.

All of above

Answer is:

Disk access is much slower than memory Access

A full binary tree with n non-leaf nodes contains log₂n nodes

A full binary tree with n non-leaf nodes contains n - 1 nodes

A full binary tree with n non-leaf nodes contains 2n nodes

A full binary tree with n non-leaf nodes contains 2n + 1 nodes

Answer is:

A full binary tree with n leaves contains n nodes

A full binary tree with n leaves contains log (n+1) nodes

A full binary tree with n leaves contains 2n - 1 nodes

A full binary tree with n leaves contains 2n nodes

Answer is:

+, -, *, a, b, c, d

a, -, b, +, c, *, d

a, b, c, d, -, *, +

-, a, b, +, *, c, d

Answer is:

left child of the node labelled 30

right child of the node labelled 5

right child of the node labelled 30

left child of the node labelled 10

Answer is: