2021年7月11日
144. Binary Tree Preorder Traversal 二叉树先序遍历
摘要： Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3] Example 2: 阅读全文
posted @ 2021-07-11 10:01 苗妙苗 阅读(42) 评论(0) 推荐(0)
98. Validate Binary Search Tree 检验二叉树是不是bst
摘要： 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 co 阅读全文
posted @ 2021-07-11 09:14 苗妙苗 阅读(42) 评论(0) 推荐(0)