I was reading my semester book fro data structures and algorithms.I am confused between adt and data structure.what is the exact difference between them?
+ can anyone give explain it with a suitable example?
An abstract data type is the specification of an interface; it's a set of operations whose behavior is defined.<p>A data structure describes how data is organized in memory.<p>Let's imagine a stack ADT with two operations: push and pop. We can decide to implement this ADT using, say, an array or a linked list. In either case, its operation will be the same (that is, you'll get the same results; but its time and space properties may be different).