<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph representing a tree with edge set [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)], can you apply the Reingold-Tilford layout algorithm to arrange the vertices on a 2D plane and visualize the tree structure of the graph?
### Response:
import igraph as ig

# Create a tree
edges = [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)]
tree = ig.Graph(edges=edges, directed=True)

# Apply Reingold-Tilford layout
layout = tree.layout_reingold_tilford(mode='OUT', root=0)

# Plot the tree
ig.plot(tree, layout=layout, vertex_label=tree.vs['name'])
<|EOT|>
