2017年3月12日

[LeetCode] 104. Maximum Depth of Binary Tree
摘要： Good reference for all tree problem https://sites.google.com/site/jennyshelloworld/company-blog/chapter-3 binary-tree-divide-conquer Analysis: Here we 阅读全文
posted @ 2017-03-12 02:48 codingEskimo 阅读(107) 评论(0) 推荐(0)
[LintCode 68] Binary Tree Postorder Traversal
摘要： 1. Recursive Straight Forward, left -> right -> root 2. Iterator This is a little bit hard to understand, here is good reference https://sites.google. 阅读全文
posted @ 2017-03-12 02:20 codingEskimo 阅读(99) 评论(0) 推荐(0)
Binary Tree Inorder Traversal
摘要： 1. Recursive Straight Forward, Add left -> root -> right 2. Iterator 1. Create a node to present current node. 2. If current node is not null and stac 阅读全文
posted @ 2017-03-12 01:54 codingEskimo 阅读(103) 评论(0) 推荐(0)
Binary Tree Preorder Traversal
摘要： 1. Recursive: Very Straight forward, If the node is not null, add root -> traversal left -> traversal right 2. Iterator(find a very good explanation h 阅读全文
posted @ 2017-03-12 01:30 codingEskimo 阅读(115) 评论(0) 推荐(0)
[LeetCode] 28. Implement strStr
摘要： Notice 1. Input String always need to be check whether it is NULL; 2. For the conner cases, source is shorter than the target or target is empty, it c 阅读全文
posted @ 2017-03-12 00:55 codingEskimo 阅读(152) 评论(0) 推荐(0)

导航