Binary tree - 69: Get closest leaf node distance from a given value in Binary Tree

Показать описание

Solution:
- We'll traverse the Binary tree in preorder manner
- while traversing we'll store the node reference in node array
- If node value matches to given value, we'll find min distance to leaf from this value, as well we'll get minimum distance to leaf node from it's parent as well

- Time Complexity: O(n) * Height of Tree
- Space Complexity: O(Height Of Tree)

Do Watch video for more info

This Problem is synonym of following problems:
binary tree Get closest leaf node distance from a given value,
Get closest leaf node distance from a given value in Binary Tree,
coding simplified,

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 200+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★

Рекомендации по теме

Комментарии

No doubt why you are getting so much love hats off to the way you explained it

And one more thing can we use map to keep the track of the distance of closest leaf from given val like for 6 we had already calculated the closest leaf now when 7 call 6 it will do the same work again similary when 2 will call 7 again the same work

sameer

This was a really solid video thank you for this!

rongav

Awesome explanation..Thanks for making this video :)

AyushiSharmaDSA

damn you made it seem easy..it was very helpful Thank you for this!

asthakur

Can we do it this way.

1) first traverse the tree and store the parent of every node in a map, so that now we have left right and the parent, ie. It has sort of converted in graph.
2) Simply apply bfs from the required node and return level whenever we encounter a leaf node for the first time.

Plz twll whether this approach will work fine ??

rajatbudania

As we can lca from that node to leaf node and than finding the total no .of node from that ancestor and one maximum variable to have the count of maximum

kumarakash

20:18 line 39 and 45 Math.Min is unnecessary

muraliable

i was thinking to run bfs from target node and the first leaf we get is the minimum distance from the target node.

ayushupadhyaya

How do we know if left returns the ans then no need to go in the right side??what is the logic here??

pqazx

can u do serialization ans deserialization

chodingninjas

Binary tree - 69: Get closest leaf node distance from a given value in Binary Tree

Binary tree - 69: Get closest leaf node distance from a given value in Binary Tree

Binary Tree - 68: Get Average of all nodes in Binary Tree

69. Binary Tree

Preorder Binary Tree Traversal

decimal to binary conversion #shorts #binary#trending #viral

Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST

Announcing the FREE ka TREE SERIES #shorts

LeetCode 69 | Sqrt(x) | Binary Search | Java

L8. Level Order Traversal of Binary Tree | BFS | C++ | Java

Binary Search in 12 seconds #shorts

EASY-HOW-TO Binary Search Tree (BST) Tutorial (Manual)

Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick

#shorts Binary search Tree in c language full code #coding

Short ⏳Trick for 2’s Complement #numbersystem #computer #cbse #gate #ugcnet #computerscience

C program for Implementation of Binary tree and traversal techniques #C program

Google Coding Interview Question: Deepest Node in a Binary Tree

lintcode-651-69-760-70 binary tree traversals - small summary

109. Convert Sorted List to Binary Search Tree #python #leetcode #leetcodedailychallenge

#152 Write a code for Display Binary Search Tree As Inorder #datastructures

Find the height of Binary Tree

Same Tree #leetcode #python

Leetcode 98 Valide Binary Search Tree

Binary Search Tree Implementation Using C++ | Complete Source Code #bst #programming #programming

GATE 2015 | Binary Search Tree