What algorithm should be used to build a nested tree?

Question

go

There is an array like this:

[{
    "Level": 0,
    "Val": "1"
}, {
    "Level": 0,
    "Val": "2"
}, {
    "Level": 1,
    "Val": "2.1"
}, {
    "Level": 1,
    "Val": "2.2"
}, {
    "Level": 2,
    "Val": "2.2.1"
}, {
    "Level": 3,
    "Val": "2.2.1.1"
}, {
    "Level": 0,
    "Val": "3"
}, {
    "Level": 1,
    "Val": "3.1"
}]

It needs to be converted to a tree like this:

[{
    "Level": 0,
    "Val": "1",
    "Children": []
}, {
    "Level": 0,
    "Val": "2",
    "Children": [{
        "Level": 1,
        "Val": "2.1",
        "Children": []
    }, {
        "Level": 1,
        "Val": "2.2",
        "Children": [{
            "Level": 2,
            "Val": "2.2.1",
            "Children": [{
                "Level": 3,
                "Val": "2.2.1.1",
                "Children": []
            }]
        }]
    }]
}, {
    "Level": 0,
    "Val": "3",
    "Children": [{
        "Level": 1,
        "Val": "3.1",
        "Children": []
    }]
}]

I can't figure out how to convert.

Answer 1

Perhaps you should use the tree implementation at the link
https://godoc.org/github.com/erriapo/redblacktree