Given a binary tree's root, determine whether it is a BST. Then, determine whether it is a valid BST. A BST is a tree in which both subtrees are binary search trees and in which the subtrees of each node are also BSTs.

Given a binary tree's root, determine whether it is a BST. Then, determine whether it is a valid BST. A BST is a tree in which both subtrees are binary search trees and in which the subtrees of each node are also BSTs.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, virtusa, company-specific

目标公司: Virtusa

参考答案摘要

We can easily solve this problem with the help of recursion. Just we need to see that every subtree must be a binary search tree. So here is the approach for the solution using the recursion. class So...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案、收藏题目并进行模拟面试练习。