gets the tree under the given element in one array, sorted so you can go through the elements from begin to end and list them as they are in the tree, where every child (until the deepest) is retreived
gets the path from the element with the given id down to the root. The returned array is sorted to start at root for simply walking through and retreiving the path