• AtomQ[expr] yields True if expr is an expression which cannot be divided into subexpressions, and yields False otherwise.
• You can use AtomQ in a recursive procedure to tell when you have reached the bottom of the tree corresponding to an expression.
for symbols, numbers, strings and other raw objects, such as sparse arrays.
for any object whose subparts cannot be accessed using functions like Map
• New in Version 1; modified in 5.