It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.

In a circular linked list organization,insertion of a record involves modification of :

(a) How many binary relations are there on a set A with n elements?

(b) How many one - to - one functions are there from a set A with n elements onto itself

If a, b and c are constants, which of the following is a linear inequality?