Check if a given array can represent preorder traversal of binary search tree
- 1. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: INT_MIN
Stack: 40
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 2. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: INT_MIN
Stack: 40, 30
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 3. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: INT_MIN
Stack: 40, 30, 20
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 4. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: INT_MIN 30
Stack: 40, 30, 20, 32
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 5. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 30
Stack: 40, 32
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 6. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 30 32
Stack: 40, 32, 35
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 7. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 32
Stack: 40, 35
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 8. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 32 40
Stack: 40, 35, 80
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 9. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 40
Stack: 80
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 10. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 40
Stack: 80, 70
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 11. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 40 70
Stack: 80, 70, 75
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 12. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 70
Stack: 80, 75
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 13. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 70
Stack: 80, 75, 73
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 14. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 70 80
Stack: 80, 75, 73, 100
40
/
30 80
/ /
20 32 70 100
35 75
/
73
- 15. Check if a given array can represent Preorder
Traversal of Binary Search Tree
Preorder: 40, 30, 20, 32, 35, 80, 70, 75, 73, 100
Root: 80
Stack: 100
40
/
30 80
/ /
20 32 70 100
35 75
/
73