- make the tree a little bit more tricky
- correct existing "mat"-tests
- add some more scenarios

Signed-off-by: Patrik Kullman <patrik.kullman@neovici.se>

- old method renamed _getPathNodes
-- fix for nodes on path logic
- make sure we try to find to path on all root nodes
-- the path with the least amount of 'undefined' wins
--- should really be 0 unless something is badly configured
---- all undefined from the beginning of the path is excluded to
     account for missing ancestors

Signed-off-by: Patrik Kullman <patrik.kullman@neovici.se>

- Adjusted sort of getPathNodes
- Return tree if !pathLocator
- added node to test tree: The response object of iron-ajax gets sorted (I guess not guaranteed) by its object keys. Therefore it was hard to let the test fail if same amount of undefined values but not equal amount of defined values. The test case took randomly the right node.