Which of the following statements is TRUE about trees? O For an array-based complete binary tree, it takes only constant time to access a node's parent. A binary tree node can never be a root and a leaf at the same time. The three cases of removing a node in a binary search tree are deleting the root, deleting a leaf node, and deleting an internal node (a node that is other than the root and the leaf nodes). O Performing a post-order traversal on an expression tree will not necessarily produce a post-fix expression.

a) Write a function that will print the even elements in each level of the binary search tree.  b) Write a function that will count total number of odd nodes of the tree.      10    /     \   6     13  /  \   /   \ 3 8 11 16   The output of the given tree when the function is applied:    10  6 8 16   Total number of odd nodes is 3. You have to answer both (a) and (b) in same code calling from main function. The base code is given bellow. Modify and write only the main function and the additional function needed to solve the problem in the answer script.   BST code:   #include<iostream> using namespace std;    struct node  {      int key;      struct node *left, *right;  };    // A utility function to search a given node bool search(struct node* root, int key)  {      // Base Cases: root is null or key is present at root      if (root == NULL)          return false;     else if(root->key == key)         return true;            // Key is greater than root's key      else if…

Which applications of binary search trees benefit most from pre-order traversal?

Given the following keys T, Y, V, Q, F, B, M. N, W, G, C, A, P, R, L. 1. Assuming the keys are inputted in that order, build a binary search tree according to the input: 2. Use an array to implement the tree you built and show the contents of the array: 3. Assuming the keys are all available at once and you can change the order if necessary, build a balanced binary search tree:

Java Binary Search Trees I have to implement an insert method for a binary search tree. Whats given is here public void insert(E key) throws DuplicateItemException {        try {                        CODE GOES HERE        }        catch (DuplicateItemException ex) {            throw ex;        }    } I need help with what goes there

#ifndef BT_NODE_H#define BT_NODE_H struct btNode{   int data;   btNode* left;   btNode* right;}; // pre:  bst_root is root pointer of a binary search tree (may be 0 for//       empty tree) and portArray has the base address of an array large//       enough to hold all the data items in the binary search tree// post: The binary search tree has been traversed in-order and the data//       values are written (as they are encountered) to portArray in//       increasing positional order starting from the first elementvoid portToArrayInOrder(btNode* bst_root, int* portArray);void portToArrayInOrderAux(btNode* bst_root, int* portArray, int& portIndex); // pre:  (none)// post: dynamic memory of all the nodes of the tree rooted at root has been//       freed up (returned back to heap/freestore) and the tree is now empty//       (root pointer contains the null address)void tree_clear(btNode*& root); // pre:  (none)// post: # of nodes contained in tree rooted at root is returnedint…

Which statement best represents the action taken when removing an element from a binary search tree that has a single child? A) replacing it with its only child B) comparing the element with the root node C simply deleting it replacing it with a duplicate parent element

In the binary search tree, write a 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: Node):

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 }

Can help in Java? Qustion : Using Binary search tree write a  Java program to Insert and print the element in (in-Order traversal ), then search the elements (a and z) in the tree… provided that user enters the values.