Binary Tree Pruning (O(n^2)) -(Google, Amazon, Microsoft) : Explanation + Live Coding 🧑🏻‍💻👩🏻‍💻

Channel:

codestorywithMIK

Subscribers:

92,300

Published on September 17, 2022 2:18:38 PM ● Video Link: https://www.youtube.com/watch?v=bzQIbtlnBW0

Duration: 16:48

105 views

13

In this video we will try to solve another popular Binary Tree problem “Binary Tree Pruning”. We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Binary Tree Pruning
Company Tags : Google, Amazon, Microsoft
Leetcode Link : https://leetcode.com/problems/binary-tree-pruning/

My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Binary%20Tree%20Pruning.cpp
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/channel/UCaw58edcO3ZqMw76Bvs0kGQ

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

Thank you
#coding #helpajobseeker #easyrecipes
#interviewpreparation #interview_ds_algo #hinglish