Question

trees are called in data structure​

Answer 1

Answer:

A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data structures. A tree can be empty with no nodes or a tree is a structure consisting of one node called the root and zero or one or more subtrees.

hope it helped and if it helps so please mark me brainliest and also follow me !

Answer 2

Explanation:

The tree is also known as a recursive data stracture. A tree can be defind as recursively because the distinguished node in a tree data stracture is known as a root node. The root node of the tree contains a link to all the roots of its subtress.