1*1212f9a0SAndroid Build Coastguard Worker<?xml version="1.0" encoding="UTF-8"?><out> 2*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of doc/b with highest value in it. That tree would be: 3*1212f9a0SAndroid Build Coastguard Worker 25 4*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of b1/b with highest value in it. That tree would be: 5*1212f9a0SAndroid Build Coastguard Worker 64 6*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of b2/b with highest value in it. That tree would be: 7*1212f9a0SAndroid Build Coastguard Worker 1230 8*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of b3/b with highest value in it. That tree would be: 9*1212f9a0SAndroid Build Coastguard Worker NaN 10*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of //b with highest value in it. That tree would be: 11*1212f9a0SAndroid Build Coastguard Worker 1230 12*1212f9a0SAndroid Build Coastguard Worker 13*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of c with highest value in it. That tree would be: 14*1212f9a0SAndroid Build Coastguard Worker NaN 15*1212f9a0SAndroid Build Coastguard Worker This is for testing the node-set of d with highest value in it. That tree would be: 16*1212f9a0SAndroid Build Coastguard Worker NaN</out>