What is a Tree?
A tree is an abstract data type which is structured like a tree. It has a root node with 2 or more branches offshooting from the root. It can be represented recursively such as each of the node can act as a root in itself. Example below.
There can be multiple implementations of the Tree ADT(abstract data type) like Binary tree, Binary Search tree. Heap is also based on the tree structure.