Given the following labeled data structure: A В D E F H J K M Assume that values are inserted into the binary search tree (BST) in the following order: 20, 35, 5, 19, 3, 28, 26, 16, 4, 31, 50, 42 Match the labels in each node shown in the diagram with the value that the node will contain after all the values have been inserted into the Binary Search Tree. (Note: Some nodes will not have a value.)

Sorting

B) What are the differences between array and linked list. C) What is meant by Binary Search Tree, (1) construct a binary tree by inserts the given values: (35, 33, 50, 10, 60, 22, 17, 48, 92,55,7). (2) Insert 58, 25 respectively (3) Delete 92, 35.

1. Refer to the following equation. ly – 51 3 e V5x i) Draw an expression tree for the equation. ii) Write the order of the nodes visited by a pre-order, in-order, level order and post- order traversal method. Show transcribed image text

24( If the binary tree is represented by the array as below, then find the parent of node 46.   a. 26 b. 96 c. 45 d. 21

Answer using C language

Q1: Consider a Single Linked List of numbers. The Head points to the first node in the list, and the 'next' points to the next node in the list. head 21 | 35 47 null 89 a) Write algorithm to add a node at the front of the Linked List b) Write algorithm to add a node at the end of the Linked List

iv) If the address of head node of a linked list is 100, the address of the next node after head node is: a) 104 b) 200 c) Can't be determined. d) 100

Draw all possible binary search trees for three data elements 5,9 and 11

Q-3 Sort the following elements using Selection Sort. 67 34 45 12 23 89 55 9 60 18 Q-4 Declare and initialize the one dimensional Array. Q-5 Describe different types of Linked List with appropriate diagram. L