- 博客(3)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode||100. Same Tree
Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example 1:In...
2018-05-03 14:53:16
249
原创 LeetCode||99. Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example 1:Input: [1,3,null,null,2] 1 / 3 \ 2 Output: [3,1,null,null,2] ...
2018-05-03 14:49:26
212
原创 LeetCode||98. Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.The right ...
2018-05-03 14:43:41
234
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人