**Contents**show

## What is tree data structure used for?

Spanning Trees and shortest path trees are used in routers and bridges respectively in computer networks. As **a workflow for compositing digital images for visual effects**.

## What is tree in algorithm?

A tree is **a hierarchical data structure defined as a collection of nodes**. Nodes represent value and nodes are connected by edges. A tree has the following properties: The tree has one node called root. The tree originates from this, and hence it does not have any parent.

## What is the disadvantage of tree data structure?

Disadvantage: **A small change in the data can cause a large change in the structure of the decision tree causing instability**. For a Decision tree sometimes calculation can go far more complex compared to other algorithms. … Decision tree training is relatively expensive as the complexity and time has taken are more.

## What are the advantages of tree data structure?

Advantages of Trees

**Trees reflect structural relationships in the data**. Trees are used to represent hierarchies. Trees provide an efficient insertion and searching. Trees are very flexible data, allowing to move subtrees around with minumum effort.

## What is BST give a real life example?

A Self-Balancing Binary Search Tree is **used to maintain sorted stream of data**. For example, suppose we are getting online orders placed and we want to maintain the live data (in RAM) in sorted order of prices. For example, we wish to know number of items purchased at cost below a given cost at any moment.

## What is a subtree of a tree?

A subtree of a tree T is **a tree S consisting of a node in T and all of its descendants in T**. The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree.