Binary Tree

Traversing Binary Trees

function preOrderWalk(currNode: BinaryNode<T> | null): void {
    if (!currNode) return;
    // Visit node
    currNode.value;
    
    preOrderWalk(currNode.left);
    preOrderWalk(currNode.right);
}

function inOrderWalk(currNode: BinaryNode<T> | null): void {
    if (!currNode) return;
       
    preOrderWalk(currNode.left);
    // Visit node
    currNode.value;
    preOrderWalk(currNode.right);
}

function postOrderWalk(currNode: BinaryNode<T> | null): void {
    if (!currNode) return;
    
    preOrderWalk(currNode.left);
    preOrderWalk(currNode.right);
    
    // Visit node
    currNode.value;
}