;; Input file for BinaryTree test case

0 16 ; Create tree with root = 16
1 0  ; Print tree
2 100000000  ; Print literal marker
3 8  ; Insert value
1 0  ; Print tree
3 24 ; Insert 24
3 4  ; Insert 4
3 12 ; Insert 12
3 20 ; Insert 20
3 28 ; Insert 28
3 14 ; Insert 14
1 0  ; Print tree
4 24 ; Search for 24
4 12 ; Search for 12
4 16 ; Search for 16
4 50 ; Search for 50
4 12 ; Search for 12
5 12 ; Delete 12
1 0  ; Print tree
4 12 ; Search for 12
-1 -1 ; End marker