22. Draw the ordered rooted tree corresponding to each of these arithmetic expressions written in prefix notation. Then write each expression using infix notation. a) +*+-53214 b) ↑ + 2 3 −51 c) */93+*24-76

Question No 5: HUFFMAN TREE                                                                                                                  Given Letters A, B, C, D, E with following frequencies.                                                             Frequency Table                         Character         Frequency       Huffman Codes                                     M                     20                   10                                     N                      11                   1110                                     O                      8                     1111                                     P                       12                   110                                     Q                      49                   0   A) Create a Single Huffman tree to determine the binary codes for each character. B) Fill the codes into the table above. C) Encode the following sequence MNOPQ.

(JAVA) Design a recursive linear-time algorithm that tests whether a binary tree satisfies the search tree order property at every node.

write a recursive C function to evaluate a binary tree. single argument is pointer to a Node. each node will have an integer value, an operation and 2 pointers to other nodes. if the operation is 0 ,then there are no other nodes and only the value of the current node should be return otherwise perform the operation and return the result plus the value of current node

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

Create a binary tree implementation using the recursive technique taught in the chapter. Each node in this method is a binary tree. As a result, a binary tree has a reference to the element stored at its root, as well as pointers to its left and right subtrees.You should also add a reference to its parent.

Design an algorithm and write code to find the first common ancestorof two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not unecessarily a binary search tree.

Computer Science Binary Search Tree Implement Binary search Tree (BST) and perform the following operations a. Insert the keys 11,66, 6,9,40,28,5, 88,125,90 b. Print the keys in sorted order using suitable traversal method. C. Search for a key x and prints its address if it is present. d. Compute height of the BST e. Print successor/predecessor of a given key f. Delete the keys 40 and 88 one by one and print the tree in level order after each delete. Note: use only recursive functions for all the operations. Write the c code with proper comments.

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: //PICTURE//   You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Also Count the height of the tree.    PLEASE USE C LANGUAGE

4) Draw separate trees with 8 nodes that are either: balanced; binary tree; neither of these. b. Write in pseudo-code or python program (related to PYTHON) to traverse the tree and verify if it is balanced and/or binary. (NOTE: Diagram of the tree is mandatory and write pseudo-code or python program based on the diagram. Please do not provide the answer which is already there on Chegg)