Multiple requests<\/strong> \u2212 As thousands of users can search data simultaneously on a web server,even a very fast server fails while searching the data.<\/li>\n<\/ul>\nTo solve the above problems, data structures come to the rescue. Data can be organized in a data structure in such a way that all items may not be required to be searched and required data can be searched almost instantly.<\/p>\n
Tree Data Structure<\/h3>\n
We read the linear data structures like an array, linked list, stack and queue in which all the elements are arranged in a sequential manner. The different data structures are used for different kinds of data.<\/p>\n
A tree<\/strong> is also one of the data structures that represent hierarchical data.<\/p>\nLet’s understand some key points of the Tree data structure.<\/strong><\/p>\n\n- A tree data structure is defined as a collection of objects or entities known as nodes that are linked together to represent or simulate hierarchy.<\/li>\n
- A tree data structure is a non-linear data structure because it does not store in a sequential manner. It is a hierarchical structure as elements in a Tree are arranged in multiple levels.<\/li>\n
- In the Tree data structure, the topmost node is known as a root node. Each node contains some data, and data can be of any type. In the above tree structure, the node contains the name of the employee, so the type of data would be a string.<\/li>\n
- Each node contains some data and the link or reference of other nodes that can be called children.<\/li>\n<\/ul>\n
Some basic terms used in Tree data structure.<\/h3>\n
Let’s consider the tree structure, which is shown below:<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663588313645-1-01.png\")
<\/p>\n
In the above structure, each node is labeled with some number. Each arrow shown in the above figure is known as a link between the two nodes.<\/p>\n
\n- Root<\/strong>: The root node is the topmost node in the tree hierarchy. In other words, the root node is the one that doesn’t have any parent. In the above structure, node numbered 1 is the root node of the tree. If a node is directly linked to some other node, it would be called a parent-child relationship.<\/li>\n
- Child node<\/strong>: If the node is a descendant of any node, then the node is known as a child node.<\/li>\n
- Parent<\/strong>: If the node contains any sub-node, then that node is said to be the parent of that sub-node.<\/li>\n
- Sibling<\/strong>: The nodes that have the same parent are known as siblings.<\/li>\n
- Leaf Node<\/strong>:- The node of the tree, which doesn’t have any child node, is called a leaf node. A leaf node is the bottom-most node of the tree. There can be any number of leaf nodes present in a general tree. Leaf nodes can also be called external nodes.<\/li>\n
- Internal nodes<\/strong>: A node has at least one child node known as an internal<\/li>\n
- Ancestor node<\/strong>:- An ancestor of a node is any predecessor node on a path from the root to that node. The root node doesn’t have any ancestors. In the tree shown in the above image, nodes 1, 2, and 5 are the ancestors of node 10.<\/li>\n
- Descendant<\/strong>: The immediate successor of the given node is known as a descendant of a node. In the above figure, 10 is the descendant of node 5.<\/li>\n<\/ul>\n
Implementation:<\/h3>\n\t\t\t\t\t\t
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663590696693-Topic.jpeg\")
<\/p>\n