Learn how to represent a polynomial with the linked list data structure.

### Also find me here:

# Baeldung Author

## Gang Wu

Gang Wu has over 15 years of experience as a software developer in multiple industries. He is proficient in software design and implementation with various programming languages, such as Java, C++, C#, etc. For the past five years, he has been working on web applications with Java technologies. When he is not writing code, he enjoys playing games and watching movies with his family.

## Here's what I've written (so far):

### Serialize and Deserialize a Binary Tree

Filed under Graph Theory, Trees

Learn algorithms to serialize and deserialize a binary tree

### Comparison Between Uniform-Cost Search and Dijkstra’s Algorithm

Filed under Path Finding

Learn how to use both Dijkstra’s algorithm and the uniform-cost search algorithm to find the shortest paths between vertices in a graph

### String Similarity Metrics – Edit Distance

Filed under Algorithms, Artificial Intelligence

Learn about the ways to quantify the similarity of strings

### Algorithms to Check If a Linked List is a Circular Linked List

Filed under Algorithms, Data Structures

Learn two linear-time algorithms that can check if a linked list is a circular linked list

### How to Reverse a Linked List

Filed under Algorithms, Programming

Have a look at the algorithm for reversing a linked list.

### How to Check If a Binary Tree Is Symmetric?

Filed under Data Structures, Trees

Learn how to check whether a binary tree structure is symmetric, using either a recursive solution or an iterative approach.

### Topological Sort of Directed Acyclic Graph

Filed under Algorithms, Data Structures, Graphs

Learn how to make a topological sort on a DAG in linear time

### Minimum Spanning Tree Vs Shortest Path Tree

Filed under Algorithms, Trees

Learn the difference between Minimum Spanning Trees and Shortest Path Trees