//Mert Ozsaydi B00451123 // define a binary search tree type - BST // a BST stores a collection of items of type ItemType // duplicate items are not allowed // objects of type ItemType must be comparable using the // relational operators: == and < ==12995== Memcheck, a memory error detector ==12995== Copyright (C) 2002-2011, and GNU GPL'd, by Julian Seward et al. ==12995== Using Valgrind-3.7.0 and LibVEX; rerun with -h for copyright info ==12995== Command: ./bsts.exe ==12995== -------------------Part 1 ---------------- BST IS EMPTY NOW IS EMPTY? EMTPY 1 ELSE 0: 1 2 7 13 ADDED TO THE BST IS EMPTY? EMTPY 1 ELSE 0: 0 -------------------Part 2 ---------------- Your assigned tree: 123 Your real tree: 123 ------Three Info------ Height of your tree: 21 Size of your tree: 614 ------ Array sorted ---- ------Three Info------ Height of your tree: 613 Size of your tree: 614 ------------------------------------------ Destructor called Destructor called Destructor called Destructor called Destructor called ==12995== ==12995== HEAP SUMMARY: ==12995== in use at exit: 0 bytes in 0 blocks ==12995== total heap usage: 1,237 allocs, 1,237 frees, 29,688 bytes allocated ==12995== ==12995== All heap blocks were freed -- no leaks are possible ==12995== ==12995== For counts of detected and suppressed errors, rerun with: -v ==12995== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 4 from 4)