BST
Goofiness
这个作者很懒,什么都没留下…
展开
-
[LeetCode]Binary Tree Preorder Traversal@Python
Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [1,2,3]Solution# Recursivelyclass Solution: def p...原创 2019-05-27 22:09:42 · 157 阅读 · 0 评论 -
[LeetCode]Binary Search Tree Iterator@Python
Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number i...原创 2019-05-30 21:37:01 · 96 阅读 · 0 评论 -
Binary Tree Inorder Traversal
Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [1,3,2]Solution# recursivelyclass Solution: def ino...原创 2019-05-23 23:59:56 · 59 阅读 · 0 评论 -
[LeetCode]Binary Tree Postorder Traversale@Python
Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [3,2,1]Solution#Recursivelyclass Solution: def ...原创 2019-05-28 23:34:21 · 77 阅读 · 0 评论 -
[LeetCode]Verify Preorder Serialization of a Binary Tree@Python
Verify Preorder Serialization of a Binary TreeOne way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we...原创 2019-06-08 23:22:59 · 140 阅读 · 0 评论