LESSON 26 / 75·2 min readIntermediate

Trees and BST in JavaScript

Should knowConcept lesson
01 Understand02 Recall03 Prepare

Tree node

JavaScript
class TreeNode {
  constructor(val, left = null, right = null) {
    this.val = val;
    this.left = left;
    this.right = right;
  }
}

Problems to practice

  • Inorder, preorder, postorder
  • Level Order Traversal
  • Maximum Depth
  • Diameter of Tree
  • Lowest Common Ancestor
  • Validate BST
  • Path Sum

Example: DFS

JavaScript
function inorder(root) {
  if (!root) return [];
  return [...inorder(root.left), root.val, ...inorder(root.right)];
}

PAUSE & RECALL

Can you explain it without the notes?

Trees and BST in JavaScript

Use your own words. Explain an example and one limitation before checking the explanation.

Check your explanation

Tree node

CONNECT IT TO YOUR INTERVIEW

Turn this concept into a clear answer.

Practice this concept
YOUR NEXT STEP

Keep connecting the ideas.

Next lesson: Heap and priority queue in JavaScript

Adapted from 16_DSA_JAVASCRIPT.md · “7. Trees and BST in JavaScript”. Examples are study fragments; framework behavior can depend on your version.