Tag archive

#tree traversal

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

3 articles

Lowest Common Ancestor (LCA) in Java: Binary Trees and DAGs

Introduction to Lowest Common Ancestor (LCA) The Lowest Common Ancestor (LCA) of two nodes p and q in a tree (or a Directed Acyclic Graph - DAG) is the lowest (i.e., deepest) node that has both p and q as descendants. A…

Apr 19, 202612 min read

Deep Dive

#dsa#java#lca

DSAIntermediate

BFS (Breadth First Search) in Java: Level-Order and Shortest Path

Introduction to Breadth First Search (BFS) Breadth First Search (BFS) is a fundamental algorithm for traversing or searching tree or graph data structures. Unlike DFS, which explores as deeply as possible along each bran…

Apr 18, 202611 min read

Deep Dive

#dsa#java#bfs

DSAIntermediate

DFS (Depth First Search) in Java: Tree and Graph Traversals

Introduction to Depth First Search (DFS) Depth First Search (DFS) is a fundamental algorithm for traversing or searching tree or graph data structures. It explores as far as possible along each branch before backtracking…

Apr 18, 202612 min read

Deep Dive

#dsa#java#dfs