Polynomial addition is implemented using ______ data structure.
2020
Polynomial addition is implemented using ______ data structure.
Answer: C. Linked list — A Linked List is the most efficient data structure for polynomial addition. Each node represents a term containing a coefficient, an exponent, and a pointer…
- A.
Trees
- B.
Stack
- C.
Linked list
- D.
Queue
Attempted by 1171 students.
Show answer & explanation
Correct answer: C
A Linked List is the most efficient data structure for polynomial addition. Each node represents a term containing a coefficient, an exponent, and a pointer to the next term. It dynamically handles any number of non-zero terms sorted by exponent order without wasting contiguous memory space. The correct option is C.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…