Ayush7614 / Ayush7614/Daily-Coding-DS-ALGO-Practice

Find the Distance between two nodes in Binary Search Tree

Open
#877 6 comments 0 reactions 1 assignee Claimed by @Pratik57 View on GitHub
LGMSOC21 🟧 Level3
Dominant language
C++
Stars
323
Forks
472
PR merge metrics
No merged PRs in 30d

Description

# Aim

- To Find the Distance between two nodes in Binary Search Tree. Find the distance between two keys in a binary tree, no parent pointers are given.

# Details

- This code will find the distance between two nodes in Binary Search Tree.
- The distance between two nodes is the minimum number of edges to be traversed to reach one node from another.
- ![nodedistancebst](https://user-images.githubusercontent.com/61999845/121894818-33c24180-cd3d-11eb-8d51-681ffbb8a0f3.JPG)

### Programming language

- [ ] C
- [ ] C++
- [x] Java
- [ ] Python

Link for the problem - https://practice.geeksforgeeks.org/problems/min-distance-between-two-givennodes-of-a-binary-tree/1 ]

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.