GO Solution For UVa 10701 - Pre, in and post. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

A common problem in data structures is to determine the traversal of a binary tree. There are three classic ways to do it:

• Pre-order: You must visit in sequence the root, left subtree and the right subtree.

• In-order: You must visit in sequence the left subtree, the root and the right subtree.

...

You can find the full details of the problem Pre, in and post at UVa Online Judge

Sample Input

3
3 xYz Yxz
3 abc cba
6 ABCDEF CBAEDF

Sample Output

Yzx
cba
CBEFDA

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985