Please implement preOrderIterator(), inOrderIterator(), and postOrderIterator() methods that use an iterator that implements Iterator<E> for a binary Search Tree in Java.

1. Modify the implementation of binary search tree and add a function to count the number of leaf nodes.   2. Modify the implementation of binary search tree and add a function to calculate the height of the tree.   Run this project in C++.

Write a program using c++  to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows:   class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.         The insertion of a node to the BST is based on the first letter of the student name.   Your program should display the following:   1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit           and Output/results provided and explain the algorithm with a given input.

Write a program using c++  to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows:   class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.         The insertion of a node to the BST is based on the first letter of the student name.   Your program should display the following:   1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit     Step by step output: ------------------------------------------------------------------------------------------------------------ Insert a node (base on ch) Find a node (base on student name) Delete a node (consider all three cases of…

What kind of tree is generated for ordered data by the Java Standard Library?

Write a function, singleParentWithLeftChild, that returns the number of nodes in a binary tree (pointed by p) that have only one left child. Your program should NOT count the nodes with one right child. (30 point)   // find the number of singles parent nodes in a binary subtree pointed by p int BST::singleParentWithLeftChild(TreeNode* p) {   //  write your code here!   }

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'))

Write a program in C++ to implement Binary Search Tree with insert, delete and search operations.

Implement a binary search tree in Python that allows duplicates. Each node must maintain a linked list for the items that are considered duplicates. Print the tree in postorder including duplicates. Create the diagram (image) of the requested tree with data and duplicate data and implement the diagram in your program with the following specification: 32 nodes and 7 lists with 2 duplicate data.