max-children-sort

d3-tree-sort.js

function getMaxDepth(node) {
	var max;
	if (node.children) {
		var c = node.children.length;
		max = node.children[0].depth;
		for (var i = 0; i < c; ++i) {
			max = getMaxDepth(node.children[i]);
		}
	} else {
		max = node.depth;
	}
	return max;
}

return getMaxDepth(a) > getMaxDepth(b) ? 1 : -1;