Based on the non-recursive algorithm, implement the binary tree first order traversal, middle order traversal and last order traversal using C++.

python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p):     root=p     def helper(root, l, r):         if not root:             return True         if not (left<root.val and root.val<right):             return False         return helper(root.l, l, root.val) and helper(root.r, root.val, r)       return helper(root, float('-inf'), float('inf'))

C++ language only pls implement a binary tree and multi-child tree that can use a generic data type. and make sure that it can be traverse the tree and can access the children nodes thanks! CODE ONLY ON C++

C++ 2 Binary search tree Consider the following BSTNode structure that represents a binary search tree node, and the BSTree structure that represents a binary search tree. The root pointer points to the root node, and size book-keeps the number of items in the binary search tree. template struct BSTNode ( T data; BSTNode left; BSTNode right; // BSTNode. parent; BSTNode (T d) : data (d), left (0), right (0)/, parent (0) / 0 // invariant 1: // (left // invariant 21 (right! null) inplies (data struct BSTree ( BSTNode root; unsigned int size: BSTree () BSTNode BSTNode BSTNode .min(); root (NULL), size (0) () insert (T d); find (T d); BSTNode next (BSTNode current); void renove (BSTNode node); //invariant: // (root = null) equiv (size -- 0) }; Implement the insert and find methods. insert should insert element d in the tree, and find takes an element d and returns a pointer to the node that has d as value if it exists. Otherwise, it returns NULL. • Implement the min, and next…