Output.docx

1.BINARY HEAP: [0, 60, 50, 30, 20, 40, 10] 60 [0, 50, 40, 30, 20, 10] 50 40 30 2.Linear Search : OUTPUT: enter the limit:5 enter the elements: 30 40 50 20 10 3.DLL 40 10 30 40 10 30 30 4.CLL:

Add first(40) add first(30) add last()10 add last()20 add mid(50,3) printnode() 30 50 40 10 20 delete f(30) delete L() delete M(2)40 deletenode()50 10 5.Breadth First Search: ABCDEFGH 6.Bubble Sort: [17,26,54,93]

7.Preorder:

1 2 4 5 3 8.Binary search tree: 4 2 5 1 3 9.Merge sort: List=[38 27 43 3 9 82 10] [3,9,10,27,38,43,82] 10.Selection Sort: lst=[3,2,9,7,5,1,8,4] [7 1 2 3 4 5 7 8 9]