给定一个二叉树的前序和中序遍历，重建这棵二叉树。

Given preorder and inorder traversal of a tree, construct the binary tree.

youdao

说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。

Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.

youdao

在数据结构中，已知一棵二叉树的先序序列和中序序列，可唯一确定此二叉树。

In the data structure, the binary tree can be uniquely confirmed when the nodes sequences of this binary tree for preorder traversal and inorder traversal are knows.

youdao

So if you now reverse the story that we're telling here, what was the next line supposed to be after sorting left half?

回退到这个过程中来，在对左半部分排完序后，下一步该做什么呢？

哈佛公开课 - 计算机科学课程节选

I have sorted with the smaller problem 1 because that smaller problem right now is of size 1 and so it's sort of obviously the case that this cup is now sorted.

对这个较小的问题我已经排好序了,因为在这个小问题中只有1个元素1,那么很明显,这个杯子已经是有序的了。

哈佛公开课 - 计算机科学课程节选

If I look for, say, minus 1, you might go, gee, wait a minute, if I was just doing linear search, I would've known right away that minus one wasn't in this list, because it's sorted and it's smaller than the first elements.

如果我要查找-1，你可能要怒了，呵呵，等一等，如果我用的是线性查找，我不会知道-1不在这个列表中,但是列表是排好序的,1又比第一个元素小。

麻省理工公开课 - 计算机科学及编程导论课程节选