Using discriminated union in F#, create a tree type that can be either an empty tree or a tree node of float * tree * tree

Please fill in the code gaps if possible. This problem has been giving me trouble. Any help is appreciated.  public class Node {       private String element; // we assume elements are character strings         private Node next;  /* Creates a node with the given element and next node. */ public Node(String s, Node n) {  //fill in body  }  /* Returns the element of this node. */ public String getElement() {  //fill in body  }  /* Returns the next node of this node. */ public Node getNext() {  //fill in body  }  // Modifier methods:  /* Sets the element of this node. */ public void setElement(String newElem) {  //fill in body  }  /* Sets the next node of this node. */ public void setNext(Node newNext) {  //fill in body  } }

C++ please

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:…

Tree Traversal Coding: How do I code the following in C program?  // ====== BEGIN INSERT FUNCTION DEFS TO WALK TREE ========= // define 3 functions - preorder, inorder, postorder to walk tree, printing out data (char) // associated with each node visited: void preorder (node* np) {} void inorder (node* np) {} void postorder (node* np) {}   walk.c file with the rest of the code given. #include <stdio.h> #include <stdlib.h> #include <stdbool.h> #include <string.h>   #define MAX_STRING 200   // ========================== NODE/TREE DEFINITIONS ========================== // define node structure  typedef struct nd {   int data;   struct nd* left;   struct nd* right; } node;   // "new" function to create a node, set data value to d and children to NULL node* newNode(int d) {   node* np;   np = (node*)malloc(sizeof(node));   if (np != NULL) {     np->data = d;     np->left = NULL;     np->right = NULL;   }   return(np); }   // declare root of our binary tree…

Create a function that uses  Node * pointing to root of AVL Tree as an input and returns the height of the AVL tree in O(log(n)).

C programming fill in the following code  #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…