Question

Basic definition of tree in data structure

Answer 1

tree is a non linear data structure in which we have root or parent node and also we have child node.

Answer 2

Tree is just like a parents which have branches trunk shook etc just like his children. in short u can say tree is an linear expression of all identities.