Data Structures Trees Question:
Explain binary tree? Explain its uses?
Answer:
A binary tree is a tree structure, in which each node has only two child nodes. The first node is known as root node. The parent has two nodes namely left child and right child.
Uses of binary tree:
- To create sorting routine.
- Persisting data items for the purpose of fast lookup later.
- For inserting a new item faster
Uses of binary tree:
- To create sorting routine.
- Persisting data items for the purpose of fast lookup later.
- For inserting a new item faster
| Previous Question | Next Question |
| Explain ree database. Explain its common uses? | How to find the depth of a binary tree? |