105. Construct Binary Tree from Preorder and Inorder Traversal

從中序遍歷和前向遍歷得到一個 preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] Return the following binary tree: 解析 查找在inorder 中根節點的index, 然後求出 左邊子樹的長度 爲 int leftsize = index - s2 六個位置關係 preorder[ ] = [ s1, s1+1 , s

>>阅读原文<<