Skip to content

Latest commit

 

History

History
25 lines (11 loc) · 533 Bytes

construct-binary-tree-from-preorder-and-inorder-traversal.md

File metadata and controls

25 lines (11 loc) · 533 Bytes

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.

分析

代码

{% codesnippet "./code/construct-binary-tree-from-preorder-and-inorder-traversal."+book.suffix, language=book.suffix %}{% endcodesnippet %}

相关题目