Binary trees are special types of trees where each node has at most two children (left child and right child). An empty tree is also considered a binary tree. Trees in general can be implemented effectively through linked lists. Since binary trees have restrictions on the maximum number of children, you can be clever and implement binary trees using arrays.

In this discussion, you are required to respond to the following question:

• Compare the two implementations for binary trees: linked lists vs. arrays. Discuss the pros and cons for each approach considering the key operations you need to perform for these trees including the different types of traversals.