2020年6月4日
94. Binary Tree Inorder Traversal
摘要： 94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. Example Input: [1,null,2,3] 1 \ 2 / 3 Output 阅读全文
posted @ 2020-06-04 15:15 iDestro 阅读(74) 评论(0) 推荐(0)
173. Binary Search Tree Iterator
摘要： 173. Binary Search Tree Iterator Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. 阅读全文
posted @ 2020-06-04 14:53 iDestro 阅读(100) 评论(0) 推荐(0)