An additional task is to construct the traversal tree generated by both algorithms. A traversal tree captures the order in which nodes or vertices are visited during the traversal. Were you able to identify all the edges in the original graph as well as in the traversal tree? If not, please provide insights into any missing edges and their implications within the graph. Perform this on the graph as illustrated below.
Starting node: Germany
Traversing order: Alphabetical priority (A-Z)
Your code should return traversal tree (both BFS, DFS) as an object of networkx and visualize it.