BST Traversals
JavaScript
let visited = [];
function inorder(node) {
if (node !== null) {
inorder(node.leftChild);
visited.push(node);
inorder(node.rightChild);
}
}
function preorder(node) {
if (node !== null) {
visited.push(node);
preorder(node.leftChild);
preorder(node.rightChild);
}
}
function postorder(node) {
if (node !== null) {
postorder(node.leftChild);
postorder(node.rightChild);
visited.push(node);
}
}