2021年3月16日
Leetcode 98. Validate Binary Search Tree
摘要： Description: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 阅读全文
posted @ 2021-03-16 17:02 summer_mimi 阅读(55) 评论(0) 推荐(0)
Leetcode 99. Recover Binary Search Tree
摘要： Description: You are given the root of a binary search tree (BST), where exactly two nodes of the tree were swapped by mistake. Recover the tree witho 阅读全文
posted @ 2021-03-16 16:23 summer_mimi 阅读(62) 评论(0) 推荐(0)