1110. Delete Nodes And Return Forest | DFS | Tree

[@dhruvgoel25]

Nice explanation 👍

[@adarshjain3058]

aaj aapse pehle subha uth kar question kar liyaaa😌

[@AnujKshatriya09]

👍👍

[@AxeCap73]

Sir please make a video on minimum swaps to make palindrome ( with concrete proof).

[@GopiVSOnline]

@aryan I have a doubt what if we removed a node which contains the another node to remove?

[@ArhamSheikh-kl1bo]

This can also be solved using postorder traversal

[@Ayush37262]

11:02 Arey bhai khena kya chahte ho 😢

[@dayashankarlakhotia4943]

class Solution { private boolean []set=new boolean[1001]; private Listans=new ArrayList (); public ListdelNodes(TreeNode root,int[]to_delete){ for(int j:to_delete) set[j]=true; if(dgf(root)!=null){ ans.add(root); } return ans; } private TreeNode dfs(TreeNode root){ if(root==null) return null; root.left =dfs(root.left); root.right =dfs(root.right); if(!set[root.val]) return root; if(root.left!=null) ans.add(root.left); if(root.right!=null) ans.add(root.right); return null; } } 🎉❤