-
Notifications
You must be signed in to change notification settings - Fork 36
Open
Labels
New-problemSuggest a new DSA problem for inclusionSuggest a new DSA problem for inclusion
Description
📝 New Problem Idea
Problem Title:
Lowest Common Ancestors in Binary Search Tree
Brief Statement:
Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.
- Simple/Beginner
- Medium/Logic
- Hard/Optimized
Topic of this Problem
Binary Search Tree, DFS , Tree , Binary Tree
Metadata
Metadata
Assignees
Labels
New-problemSuggest a new DSA problem for inclusionSuggest a new DSA problem for inclusion