everest% CC main2.C bstree.o
everest% 
everest% a.out

Inorder Walk
((( [1,a] ) [2,a] ( [3,a] ( [4,a] ))) [5,a] (( [6,a] ) [8,a] ( [9,a] )))

Edit tree:
Integer to search: 3
Found: [3,a]
New value for stuff: h
Integer to search: 4
Found: [4,a]
New value for stuff: e
Integer to search: 5
Found: [5,a]
New value for stuff: l
Integer to search: 6
Found: [6,a]
New value for stuff: l
Integer to search: 8
Found: [8,a]
New value for stuff: o
Integer to search: 7
Not found
Integer to search: 15
Not found
Integer to search: -1
Not found
Integer to search: ^D 

Inorder Walk
((( [1,a] ) [2,a] ( [3,h] ( [4,e] ))) [5,l] (( [6,l] ) [8,o] ( [9,a] )))
everest%