2018年10月18日
[leetcode] Maximum Binary Tree
摘要： Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number in the array. Th 阅读全文
posted @ 2018-10-18 17:56 Lin.B 阅读(195) 评论(0) 推荐(0)
[leetcode] Binary Tree Preorder Traversal
摘要： Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] Follow up: Recursive s 阅读全文
posted @ 2018-10-18 15:10 Lin.B 阅读(88) 评论(0) 推荐(0)
[leetcode] Binary Tree Zigzag Level Order Traversal
摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文
posted @ 2018-10-18 14:47 Lin.B 阅读(126) 评论(0) 推荐(0)