DFS On Tree · Embed | Leonardo Wajda

    
  

  


  


  


  

void dfs(TreeNode node) {
    if (node == null) return;
    visit(node);
    dfs(node.left);
    dfs(node.right);
}
def dfs(node) -> None:
    if not node:
        return
    visit(node)
    dfs(node.left)
    dfs(node.right)
def dfs(node: TreeNode): Unit =
  if node != null then
    visit(node)
    dfs(node.left)
    dfs(node.right)
void dfs(TreeNode* node) {
    if (node == nullptr) return;
    visit(node);
    dfs(node->left);
    dfs(node->right);
}