Postorder traversal
A binary tree traversal pattern using depth first search that first visits the left node, then the right node, then the current node.
function postorder(node) {
if (node) {
postorder(node.left);
postorder(node.right);
console.log(node.val);
}
}