Maximum Sum BST in Binary Tree | EPIC Tree Series | BST | DSA | Hindi

Lecture Resources https://github.com/Tiwarishashwat/Jav... Problem Name: 1373. Maximum Sum BST in Binary Tree Problem Statement: Given a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees. Problem link: https://leetcode.com/problems/maximum... Samsung Interview Experience:    • I cracked Samsung | SRIB Interview Experie...   Company Tags: Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung Timestamp: 0:00 - Introduction #ShashwatTiwari #coding​​ #problemsolving​