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...

I need to write a binary search tree in c++, without using classes; struct can be used. Inside the binary tree i need the following functions: Insert a value Delete a value Print the values inside the tree inorder. Thank you!

4. Complete the fuction definition given below that takes the root node of a tree as a parameter and returns the count of nodes. int count_nodes(Node *root){ // complete the function }

Please with question in image in C++ language. Thanks

Please help with C++ question in image. Thank you.

Tree.java: This is a simple binary tree class that should be used to represent the data in your Huffman tree. You only need to implement two of the methods (_printTree and compareTo). Huffman.java: This file contains all of the logic required to implement a Huffman tree. The code in this file relies on the Tree.java file. You must provide the implementation for all of the methods in this class. public class Main { /* * tree.txt should produce this tree: * 16 * / \ * 6 Z * / \ * A D * * A (1), D (5), Z (10) * * Codes: * A: 00 * D: 01 * Z: 1 * * Preorder Traversal: * 16, 6, 1 (A), 5 (D), 10 (Z) */ public static void main(String[] args) throws Exception { Huffman huff = new Huffman(); huff.buildTreeFromFile("tree.txt"); // Print the tree: System.out.println("printTree tests:"); huff.printTree(); // Expected output: [16: , 6: , 1:A, 5:D, 10:Z] // Get some codes:...