## Question 1
Select the correct binary tree constructed from preorder and inorder traversal:

preorder = [1, 12, 15, 6, 9, 5, 2]

inorder = [15, 12, 6, 1, 5, 9, 2]
### Options

1. ``` text
    1
   /  \
  12   9
 / \  / \
15  6 5  2 
```
Correct
This tree has the same preorder and inorder as given in the question.
----------------------------

2. ``` text
    12
   /  \
  1    9
 / \  / \
15  6 5  2 
```
Incorrect

----------------------------

3. ``` text
    15
   /  \
  12   9
 / \  / \
1  6 5   2 
```
Incorrect

----------------------------

4. ``` text
    9
   /  \
  1   12
 / \  / \
15  6 5  2 
```
Incorrect

----------------------------

---------------------------------------------

## Question 2
Select the correct binary tree constructed from preorder and inorder traversal:

preorder = [1, 2, 4, 7, 3]

inorder = [4, 2, 7, 1, 3]
### Options

1. ``` text
    3
   / \
  1   2
 / \    
4   7   
```
Incorrect

----------------------------

2. ``` text
    1
   / \
  2   3
 / \    
4   7   
```
Correct
This tree has the same preorder and inorder as given in the question.
----------------------------

3. ``` text
    7
   / \
  2   3
 / \    
4   1   
```
Incorrect

----------------------------

4. ``` text
    4
   / \
  2   3
 / \    
1   7   
```
Incorrect

----------------------------

---------------------------------------------