---
title: "Discussion on \"Lowest Common Ancestor of a Binary Search Tree\" | Hashnode"
description: "Discussion on \"Lowest Common Ancestor of a Binary Search Tree\". Problem\nAccording to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” \nExample 1:\n..."
url: "https://hashnode.com/posts/lowest-common-ancestor-of-a-binary-search-tree/6885bed9759c326d3ffd0003"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Lowest Common Ancestor of a Binary Search Tree](https://chetan77.hashnode.dev/lowest-common-ancestor-of-a-binary-search-tree?utm_source=hashnode&utm_medium=feed)

Problem According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” Example 1: ...

Jul 27, 2025 · 2 min read · chetan77.hashnode.dev  
Read the article

-   [#lowest-common-ancestor-of-a-binary-search-tree](https://hashnode.com/tag/lowest-common-ancestor-of-a-binary-search-tree)
-   [#binary-search-tree](https://hashnode.com/tag/binary-search-tree)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#java](https://hashnode.com/tag/java)
-   [#binarytrees](https://hashnode.com/tag/binarytrees)
-   [#lowest-common-ancestor](https://hashnode.com/tag/lowest-common-ancestor)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

  
[View profile](https://hashnode.com/@chetan77)

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
