Rebuilding a binary tree in the middle and back order

Binary Tree depth Time Limit: 1000 ms memory limit: 65536 k any questions? Click Here ^_^ Description

The central and post-order traversal sequences of a binary tree are known to evaluate the depth of the binary tree.

Input

There are multiple groups of input data.T, Indicates thatTGroup data. Each group of data contains two data types with a length less50The first string represents the central traversal of the binary tree, and the second represents the post-sequential traversal of the binary tree.

Output the depth of the binary tree. Sample Input

2 dbgeafcdgebfcalnixulinux

Sample output

4

3

Come on .. Employees are not afraid of difficulties

 

Rebuilding a binary tree in the middle and back order