本文整理汇总了Python中solution.Solution.isValidBST方法的典型用法代码示例。如果您正苦于以下问题：Python Solution.isValidBST方法的具体用法？Python Solution.isValidBST怎么用？Python Solution.isValidBST使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类solution.Solution的用法示例。
在下文中一共展示了Solution.isValidBST方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_2
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import isValidBST [as 别名]
def test_2():
sol = Solution()
a2 = TreeNode(2)
a6 = TreeNode(6)
a4 = TreeNode(4)
a2.left, a2.right = a6, a4
a3 = TreeNode(3)
a5 = TreeNode(5)
a4.left, a4.right = a3, a5
assert not sol.isValidBST(a2)示例2: test_1
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import isValidBST [as 别名]
def test_1():
sol = Solution()
a2 = TreeNode(2)
a1 = TreeNode(1)
a4 = TreeNode(4)
a2.left, a2.right = a1, a4
a3 = TreeNode(3)
a5 = TreeNode(5)
a4.left, a4.right = a3, a5
assert sol.isValidBST(a2)示例3: test_0
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import isValidBST [as 别名]
def test_0():
sol = Solution()
assert sol.isValidBST(None)
assert sol.isValidBST(TreeNode(9))示例4: len
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import isValidBST [as 别名]
tn.left = left
q.append(left)
idx += 1
if idx == len(tree):
break
right = constructOne(tree[idx])
idx += 1
tn.right = right
q.append(right)
return root
def printNode(tn, indent):
sb = ""
for i in range(indent):
sb += "\t"
sb += str(tn.val)
print(sb)
def printTree(root, indent):
if not root:
return
printTree(root.right, indent + 1)
printNode(root, indent)
printTree(root.left, indent + 1)
# inpt = createTree(['1', '2', '3', '#' , '#', '4', '#', '#', '5'])
inpt = createTree(['2', '1', '6', '#' , '#', '3', '#', '#', '4'])
sol = Solution()
res = sol.isValidBST(inpt)
print(res)