Given the preorder and inorder traversals of a binary tree, you build that binary tree. Preorder: $x,A,E,Y,C,K,D,L$

In$-$order: $A,Y,$ E $,x,C,$ D $,K,$ L