HCL Technologies SWE Interview Question 2021 August | Binary Trees | on-campus

Question 1 Problem Statement Given the root of a binary tree, determine if it is a valid Binary Search Tree (BST). A valid 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 valid BSTs Constraints The number of nodes in the tree is ...