Compile and run the binary search tree C++ code. Fill in the remaining code as needed to make it work. Basically, what is missing from this code that would make it work.

decr There we also 12 ent such n g our class template as shown in Figure Figure 12.1 A Binary Search Tree esm class Template BST h contains the declaration of class tem Basic operations B Constructor: Constructs an empty BST Checks if a BST is empty empty and others to be added #include kios tream> #ifndef BINARY SEARCH TREE #define BINARY SEARCH TREE template