BST.cpp
#include “BST.h”
#include “BT-visualize.h”
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <string>
// Implement the following five methods
// inserts val into BST rooted at x and returns the tree’s newroot
BTnode * insert(BTnode * x, int val) {}
// returns true iff target in tree rooted at x
bool search(BTnode * x, int target) {}
// Find the maximum value of a tree rooted at x
int findmax(BTnode * x) {}
// Find the manimum value of a tree rooted at x
int findmin(BTnode * x) {}
// Given a binary tree,
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured