我有一棵这样的树
array(
array('name'=>'n1', 'timestamp'=>1000, 'children'=> array()),
array('name'=>'n2', 'timestamp'=>2000, 'children'=> array(
array('name'=>'n3', 'timestamp'=>3000, 'children'=> array()),
array('name'=>'n4', 'timestamp'=>4000, 'children'=> array(
array('name'=>'n5', 'timestamp'=>4000, 'children'=> array()),
array('name'=>'n6', 'timestamp'=>3000, 'children'=> array())
)),
)),
array('name'=>'n7', 'timestamp'=>3000, 'children'=> array())
)
-n1
-n2
-n3
-n4
-n5
-n6
-n7
我想按每个级别 DESC 上的时间戳对其进行排序,因此结果将是
-n7
-n2
-n4
-n5
-n6
-n3
-n1