---
title: "Decision tree advantages and disadvantages"
subject: "Data Mining"
chapter: 3
key: "semester_7/data_mining:decision-tree-pros-cons"
source: https://www.bctengineer.com/q/semester_7/data_mining/decision-tree-pros-cons
site: BCT Engineering
---

# Decision tree advantages and disadvantages

Data Mining · Chapter 3: Classification

- Asked in: year not given
- Video: [Lec-9: Introduction to Decision Tree 🌲 with Real life examples](https://www.youtube.com/watch?v=mvveVcbHynE) — Gate Smashers
- Answer checked by Claude Opus 5.5 (high effort) on 2026-10-14
- Page: https://www.bctengineer.com/q/semester_7/data_mining/decision-tree-pros-cons
- Whole chapter: https://www.bctengineer.com/md/semester_7/data_mining/chapter-3

## Question

What are the advantages and disadvantages of Decision Tree Classifier?

## Short answer

Decision trees are easy to interpret, handle numeric and categorical data and missing values, need little data preparation, and are fast to train and classify. Disadvantages include overfitting on noisy data, instability to small changes, greedy locally optimal splits, bias toward attributes with many values, and inability to represent oblique or XOR boundaries efficiently.

## Answer

#### Advantages
- **Easy to understand and interpret**; the tree can be drawn and turned into IF-THEN rules.
- Needs **little data preparation** (no normalisation) and no domain knowledge or parameter setting.
- Handles both **numeric and categorical** attributes, and can handle missing values (C4.5).
- **Fast** to build and very fast to classify (cost proportional to tree depth).
- Does **automatic feature selection**; irrelevant attributes are not used.
- Non-parametric: no assumption about data distribution.
- Accuracy is comparable to other classification methods on many data sets.

#### Disadvantages
- **Overfitting** with noisy data and large trees; needs pruning.
- **Unstable**: a small change in data can produce a very different tree.
- Greedy search gives only locally optimal trees; finding the optimal tree is NP-complete.
- Biased toward attributes with many values (information gain).
- Axis-parallel splits cannot represent some relations (e.g. XOR, oblique boundaries) efficiently; the tree may become very large (replication, fragmentation).
- Poor for continuous target prediction (piecewise constant), and does not cope well with class imbalance.
- Data fragmentation: few records remain at deep nodes, so decisions are unreliable.

## Check yourself

The answer's key points as multiple-choice questions, with the correct option and why.

1. Decision trees need:
   A. Heavy normalisation
   B. Only numeric data
   C. Little data preparation, no normalisation
   D. Domain knowledge
   Answer: C. They handle numeric and categorical data. (Key point: Data preparation)

2. Unstable means:
   A. Trees are slow
   B. Trees always overfit
   C. Trees cannot be pruned
   D. A small change in data can give a very different tree
   Answer: D. One of the disadvantages. (Key point: Instability)

3. Because search is greedy, trees are:
   A. Only locally optimal
   B. Globally optimal
   C. Always shallow
   D. Always balanced
   Answer: A. Finding the optimal tree is NP-complete. (Key point: Greedy)

4. Data fragmentation means:
   A. Data are split across files
   B. Few records remain at deep nodes, making decisions unreliable
   C. Attributes are deleted
   D. Missing values are filled
   Answer: B. Deep nodes have little data. (Key point: Fragmentation)

## Related in Data Mining

- [Decision tree classifier and Hunt's algorithm](https://www.bctengineer.com/question.md?key=semester_7%2Fdata_mining%3Adecision-tree-hunt) — Data Mining, chapter 3
- [Short note: Decision tree](https://www.bctengineer.com/question.md?key=semester_7%2Fdata_mining%3Adecision-tree-note) — Data Mining, chapter 3
- [Overfitting in ID3 and decision tree rules](https://www.bctengineer.com/question.md?key=semester_7%2Fdata_mining%3Aid3-overfitting-rules) — Data Mining, chapter 3
- [Extracting rules from decision tree](https://www.bctengineer.com/question.md?key=semester_7%2Fdata_mining%3Arules-from-decision-tree) — Data Mining, chapter 3

## Related in other subjects

- [Explain decision tree analysis](https://www.bctengineer.com/question.md?key=semester_6%2Fengineering_economics%3Aexplain-decision-tree) — Engineering Economics, chapter 6, asked 5×
- [Decision tree for plant improvement alternatives](https://www.bctengineer.com/question.md?key=semester_6%2Fengineering_economics%3Adecision-tree-plant-alternatives) — Engineering Economics, chapter 6, asked 2×
- [Decision tree; infinite source blocking formulas](https://www.bctengineer.com/question.md?key=semester_8%2Ftelecommunications%3Adecision-tree-infinite-sources) — Telecommunications, chapter 6, asked 2×
- [Decision tree; finite source blocking formulas](https://www.bctengineer.com/question.md?key=semester_8%2Ftelecommunications%3Adecision-tree-finite-sources) — Telecommunications, chapter 6, asked 2×