Tree Data Structure

Define a tree data structure and why use it?

A special type of self-balancing search tree in which each node can contain more than one key and have more than two children. It is a generalized form of the binary search tree.

(a)  

An entity that contains a key or value and pointers to its child nodes

(a)  

The node which is a predecessor of a node.

(a)  

The node which is the immediate successor of a node.

(a)  

The topmost node of a tree. It is also the node which does not have any parent node,

(a)  

The nodes which do not have any child nodes.

(a)  

Any predecessor nodes on the path if the root to that node.

(a)  

Any successor node on the path from the leaf node to that node

(a)  

Children of the same parent node.

(a)