Answer:
Tree structure is an algorithm which are used for locating and placing the files in the database. Trees are helpful for searching the database in more easier way. In tree records are stored in the location known as leaves.
They also reduce the overall complexity of the database with the help of trees nodes and terminal.
The concept of divide and conquer in tree provide minimum time to search any type of the database.
