![[LeetCode每日一题]105. Construct Binary Tree from Preorder and Inorder Traversal](https://weiguangli.com/wp-content/themes/frontopen2_v1.5.04.15/timthumb.php?src=https://weiguangli.com/wp-content/uploads/2020/02/LeetCode_Sharing.png&h=140&w=205&zc=1)
题目如下：
Given preorder and inorder traversal of a tree, construct the binary tree.
eg:
preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
re.... Read More >
标签归档：LeetCode
题目如下：
Given preorder and inorder traversal of a tree, construct the binary tree.
eg:
preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
re.... Read More >
2020
02-21
02-21
[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] i.... Read More >
2020
02-20
02-20
[LeetCode每日一题]100. Same Tree
题目如下：
Given two binary trees, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurall.... Read More >
题目如下:
Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
LeetCode-99 Recover Binary.... Read More >