Arrays:
An array is the simplest data structure. It is a collection of elements, each with a key. You access the elements by typing in the key.
Stacks:
A stack is LIFO (Last-In-First-Out) data structure. The last element that is added must be the first one taken out.
Queues:
A queue is a FIFO (First-In-First-Out) data structure. The first element added to the queue will be the first one that can be removed.
Binary Trees:
A binary tree is a tree data structure. The starting “parents” are called “roots,” and each parent can have at most two children. The children that do not have children are referred to as “leaves.”
Way to get the main points across
LikeLike
Thank you.
LikeLike
simple and straight to the point. well done
LikeLike
Thanks.
LikeLike