The deployment of telephone lines in city network that can connect to all city nodes is :

Question

Question

This question was previously asked in

NIELIT Scientific Assistant IT 5 Dec 2021 Official Paper

Answer 1

The correct answer is option 3: Spanning Tree

Key Points

A Spanning Tree of a graph is a subgraph that:
- Connects all the vertices (nodes) together
- Contains no cycles
- Uses minimum number of edges: for a graph with n vertices, a spanning tree has exactly n-1 edges
This is ideal for deploying communication lines like telephone or electrical wiring, minimizing cost and avoiding redundancy.

Additional Information

Binary Search Tree (BST): Used for searching and sorting, not suitable for network deployment.
AVL Tree: A self-balancing BST, efficient for dynamic data operations, not for physical network connection.
Height Balanced Search Tree: Another term for AVL or Red-Black Tree — again, not suitable here.

Hence, the correct answer is: option 3: Spanning Tree