Function asOrdinal

Replaces all tree nodes with their unique ordinal. The order is depth-first post-order, so that the root node value is the maximum. For example a tree shaped so:

 ┬?
 ├─?
 └┬?
  ├─?
  └─?
Copy

Will become this tree:

 ┬5
 ├─1
 └┬4
  ├─2
  └─3
Copy

Under the pre key you will find a version that does the same but in depth-first pre-order, and under the breadthFirst key you will find a version that does the same but in breadth-first order.