What is a tree in data structures

Answer 1

There is this in the Data Structures collection of SL

https://www.sololearn.com/learn/322/?ref=app

Answer 2

Trees: Unlike Arrays, Linked Lists, Stack and queues, which are linear data structures, trees are hierarchical data structures.

Tree Vocabulary: The topmost node is called root of the tree. The elements that are directly under an element are called its children. The element directly above something is called its parent. For example, a is a child of f and f is the parent of a. Finally, elements with no children are called leaves.

https://www.geeksforgeeks.org/binary-tree-set-1-introduction/