# I. Open-Ended Learn to write the algorithmPseudocode for the Exam I.pdf

1 de Apr de 2023
1 de 1

### I. Open-Ended Learn to write the algorithmPseudocode for the Exam I.pdf

• 1. I. Open-Ended: Learn to write the algorithm/Pseudocode for the Exam II topics. 1. Define binary tree and Binary search tree. Insert 1,62,53,4,51,6,79,8,9,10,23,45, 78,21 in the BST. Write the algorithms for all the 3 operations of BST. 2. Sort 22,78,10,56,12,7,34,56 in ascending order using the Heapsort. Also write the algorithm. 3. Sort 44,21,45,32,99,78,20,43 in descending order using the Heapsort. Also write the algorithm. 4. Insert 55,99,21,33,90,11,43,67,78,40,32,54,68,100 into an empty Binary Search Tree. 5. Delete the integers 6,10,3 and 8 (one at a time) from the below tree. 6. Define Huffiman coding technique. Construct a Huffiman coding tree using the given Letters and frequencies below. Write the algorithm. 7. Find the Pre-order, Post-order, and In-order for the given BST. Learn to write the Pseudocode.