#pragma oncetemplate <class T> class BST;template <class T>class BSTNode{private: T val; BSTNode* left; BSTNode* right; int depth; int height; friend class BST<T>;public: BSTNode(const T& v, BSTNode* left, BSTNode* right); ~BSTNode(){}; T get_val() { return val;} BSTNode* getLeft() { return left; } BSTNode* getRight(){ return right; }};template <class T>BSTNode<T>::BSTNode(const T& v, BSTNode* left, BSTNode* right){ val = v; this->left= left; this->right=right; depth = height= -1; // Not computed yet}can you implement these following codes in the pictures please BST Programming Challenges- Provide your implementation for all the functions in the following exercises, as well as your implementationof main() in HW3.cpp .- Adding private functions (in BST.h only) is allowed but modifying anything else is not allowed- Do not add or remove any files.Ex1. DLL2BST (15 points)Add a constructor that constructs the binary search tree from the given DLList.BST::BST(const DLL& list)Ex2. Find the Second Minimum (25 points)Write a member function called int BST::Find_Second_Minimum() const. The functionretrieves the value of the node that has the second minimum value in the current BST. The secondminimum is the element just greater than the minimum number. The running time of yourimplementation should be o(h).Ex3. Get the Longest Path (25 points)Write a member function called DLList BST:: get_longest_path() that returns a DLL ofthe longest path in the tree. For example, the red nodes in the following tree are on the longest pathand should be added to the list. In case there are multiple longest paths, retrieve any of them. Ex4. Extract SubTree (25 points)Write a BST member function BST BST::Copy_subTree(const T& n) that will extract andreturn the subtree rooted at the node containing the value n.For example, on the following tree, the function should return the subtree shown to the right.The current treeThe returned BSTThe current Tree after calling the function121230309 143939Ex5. New Traverse (Bonus 20 points)Write a BST member function void BST::BFT() that will print the tree elements in the way thatis shown in the next figure10020(2001030(150(300)Ex6. Main (10 points)Write a main() function that tests the functions you implemented in exercises 1-5.

Answered: Image /qna-images/answer/21b4c780-9820-478e-9528-17f4b9e04e5e.jpg

Answered: BST Programming Challenges A - Provide…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

#pragma once
template <class T> class BST;
template <class T>
class BSTNode{
private:
T val;
BSTNode* left;
BSTNode* right;
int depth;
int height;
friend class BST<T>;
public:
BSTNode(const T& v, BSTNode* left, BSTNode* right);
~BSTNode(){};
T get_val() { return val;}
BSTNode* getLeft() { return left; }
BSTNode* getRight(){ return right; }
};

template <class T>
BSTNode<T>::BSTNode(const T& v, BSTNode* left, BSTNode* right){
val = v;
this->left= left;
this->right=right;
depth = height= -1; // Not computed yet
}

can you implement these following codes in the pictures please