Number of possible tree = (2 power of n) – n
Hashing is a technique to retrieve records from memory quickly.
Linear data structures are data structures whose data are in linear. eg: Arrays
Non linear are data structures whose data are non linear format. eg: Trees
Polish and Reverse Polish notations.
Yes, Selection method is used for Selection sort.