Merge Binary Trees

# Introduction

In this challenge, we will merge two binary trees into a new binary tree. The merging operation initiates from the root nodes of both trees. If two nodes overlap, the resulting merged node will contain the sum of respective node values. If the nodes do not overlap, the non-null node will become a node of the newly created binary tree. Finally, the new merged binary tree will be presented as the output.