(4,7)

(7,4)

(6,3)

(3,6)

(1 2(4 5 6 7))

1((2 3 NULL)4 5 6)7)

(1(234)(567)

(1(2 3 NULL)(4 5))

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

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

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