2019年3月5日
19.3.5 [LeetCode 106] Construct Binary Tree from Inorder and Postorder Traversal
摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2019-03-05 11:22 TobicYAL 阅读(320) 评论(0) 推荐(0) 编辑
19.3.5 [LeetCode 105] Construct Binary Tree from Preorder and Inorder Traversal
摘要： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2019-03-05 11:08 TobicYAL 阅读(173) 评论(0) 推荐(0) 编辑
19.3.5 [LeetCode 104] Maximum Depth of Binary Tree
摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2019-03-05 10:41 TobicYAL 阅读(139) 评论(0) 推荐(0) 编辑
19.3.5 [LeetCode 103] 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 @ 2019-03-05 10:35 TobicYAL 阅读(194) 评论(-1) 推荐(0) 编辑