Tree/construct_tree_inorder_postorder library

🌳 Construct Binary Tree from Inorder and Postorder Traversal

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

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

Example:

final inorder = [9,3,15,20,7];
final postorder = [9,15,7,20,3];
final root = buildTreeFromInorderPostorder(inorder, postorder);

Functions

buildTreeFromInorderPostorder<T>(List<T> inorder, List<T> postorder) → BinaryTreeNode<T>?