2017年11月9日
leetcode — convert-sorted-list-to-binary-search-tree
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/ * * * Given a singly lin... 阅读全文
posted @ 2017-11-09 21:58 lacker 阅读(178) 评论(0) 推荐(0) 编辑
leetcode — convert-sorted-array-to-binary-search-tree
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * Source : https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ * * Given an array wh... 阅读全文
posted @ 2017-11-09 21:57 lacker 阅读(139) 评论(0) 推荐(0) 编辑
leetcode — construct-binary-tree-from-preorder-and-inorder-traversal
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * Source : https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ * * *... 阅读全文
posted @ 2017-11-09 08:18 lacker 阅读(215) 评论(0) 推荐(0) 编辑
leetcode — construct-binary-tree-from-inorder-and-postorder-traversal
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ * * * G... 阅读全文
posted @ 2017-11-09 08:18 lacker 阅读(203) 评论(0) 推荐(0) 编辑
leetcode — maximum-depth-of-binary-tree
摘要： ``` / Source : https://oj.leetcode.com/problems/maximum depth of binary tree/ Given a binary tree, find its maximum depth. The maximum depth is the nu 阅读全文
posted @ 2017-11-09 00:48 lacker 阅读(112) 评论(0) 推荐(0) 编辑
leetcode — binary-tree-zigzag-level-order-traversal
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; / Source : https://oj.leetcode.com/problems/binary tree zigzag level o 阅读全文
posted @ 2017-11-09 00:47 lacker 阅读(141) 评论(0) 推荐(0) 编辑
leetcode — binary-tree-level-order-traversal
摘要： ``` import org.lep.leetcode.binarytreeinordertraversal.BinaryTreeInOrderTraversal; import java.util.ArrayList; import java.util.Arrays; import java.ut 阅读全文
posted @ 2017-11-09 00:46 lacker 阅读(180) 评论(0) 推荐(0) 编辑
leetcode — symmetric-tree
摘要： ``` import java.util.Stack; / Source : https://oj.leetcode.com/problems/symmetric tree/ Given a binary tree, check whether it is a mirror of itself (i 阅读全文
posted @ 2017-11-09 00:45 lacker 阅读(188) 评论(0) 推荐(0) 编辑