Tree/construct_tree_inorder_preorder library

🌳 Construct Binary Tree from Inorder and Preorder Traversal

Builds a binary tree from given inorder and preorder traversal lists.

Time complexity: O(n) Space complexity: O(n)

Example:

final inorder = [9,3,15,20,7];
final preorder = [3,9,20,15,7];
final root = buildTreeFromInorderPreorder(inorder, preorder);

Functions

buildTreeFromInorderPreorder<T>(List<T> inorder, List<T> preorder) → BinaryTreeNode<T>?