POTD- 01/12/2023 | Check whether BST contains Dead End | Problem of the Day | GeeksforGeeks

[@GeeksforGeeksPractice]

Problem Solution Link 🔗: ide.geeksforgeeks.org/online-cpp-compiler/12ee2485-7dbc-4480-a359-fd0797b660e6

[@prateekbhaisora]

Another Alternative approach using ranges: class Solution{ public: bool solve(Node *root, int low, int high) { int val = root->data; if (!root->left && !root->right) { bool l = low > 0 && low 0 && val+1 left) l = solve(root->left, low, val-1); if (root->right) r = solve(root->right, val+1, high); return l || r; } bool isDeadEnd(Node *root) { return solve(root, 1, 10001); } // TC = O(n) SC = O(n) };