1261. Find Elements in a Contaminated Binary Tree | leetcode daily challenge | shashcode | java dsa

Problem Link: https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/?envType=daily-question&envId=2025-02-21 Problem Statement: Given a binary tree with the following rules: root.val == 0 For any treeNode: If treeNode.val has a value x and treeNode.left != null, then treeNode.left.val == 2 * x + 1 If treeNode.val has a value x and treeNode.right != null, then treeNode.right.val == 2 * x + 2 Now the binary tree is contaminated, which means all treeNode.val have been changed to -1. Implement the FindElements class: FindElements(TreeNode* root) Initializes the object with a contaminated binary tree and recovers it. bool find(int target) Returns true if the target value exists in the recovered binary tree. Solution Link: https://github.com/Tiwarishashwat/InterviewCodes/blob/main/FindElementsInAContaminatedBinaryTree.java Custom Comparator: https://youtu.be/quegYlReztM?si=G265RK8IFpP92_4b Lambda Expression: https://youtu.be/3DkmAUdrzKw?si=q9pqrvNPKAXt1g0d Dynamic Programming: https://youtu.be/P3MFBCZCGXs?si=A832THtbhyqPNAf2 Graph Playlist: https://www.youtube.com/playlist?list=PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ Java Plus DSA Placement Course Playlist: https://youtube.com/playlist?list=PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE Java Plus DSA Sheet: https://docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing Notes: https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course Telegram Link: https://shashwattiwari.page.link/telegramShashwat Ultimate Recursion Series Playlist: https://youtube.com/playlist?list=PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK Instagram Handle: (@shashwat_tiwari_st) https://shashwattiwari.page.link/shashwatInsta Samsung Interview Experience: https://youtu.be/GrvlpBzphSU Company Tags: Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung Timestamp: 0:00 - Introduction