03 2019 档案

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 阅读(345) 评论(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 阅读(185) 评论(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 阅读(152) 评论(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 阅读(209) 评论(-1) 推荐(0)
19.3.4 [LeetCode 102] Binary Tree Level Order Traversal
摘要：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 阅读全文
posted @ 2019-03-04 22:42 TobicYAL 阅读(170) 评论(0) 推荐(0)
19.3.2 [LeetCode 101] Symmetric Tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2019-03-02 13:34 TobicYAL 阅读(163) 评论(0) 推荐(0)
19.3.2 [LeetCode 99] Recover Binary Search Tree
摘要：Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Example 1: Example 2: Follow up: A 阅读全文
posted @ 2019-03-02 13:18 TobicYAL 阅读(180) 评论(0) 推荐(0)
19.3.2 [LeetCode 98] Validate Binary Search Tree
摘要：Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2019-03-02 11:26 TobicYAL 阅读(221) 评论(0) 推荐(0)