80) Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree ?

(1 2(4 5 6 7))

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

(1(234)(567)

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

Answer is:

(1(234)(567)

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:

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: