Feed
Pro
Search

Sign in
Darkshift - a dark factory for software Bug0 - The AI-native e2e QA regression testing The foreword by Hashnode - official blog from the Hashnode team Passmark - The open-source AI framework for regression testing Hashnode gql skill - let your AI agent publish to your Hashnode blog Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Search Hashnode

Search posts, tags, users, and pages

Discussion on "Lowest Common Ancestor of a Binary Search Treen (Leetcode #235)" | Hashnode

FeedDiscussion

Nawat Sunthornyanakit

Aug 10, 2024

Lowest Common Ancestor of a Binary Search Treen (Leetcode #235)

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. 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...

earthcode.hashnode.dev3 min read

#leetcode #python

Responses

No responses yet.