1. (25 points) Give the definition of the following concepts in your own words. Binary search...

Transcribed Image Text:

1. (25 points) Give the definition of the following concepts in your own words. Binary search tree - is a rooted free that internat podes each Store a key and have two subtree Preorder traversal the root node visited first, then left subtree then right subtree asceyding Inorder traversal - Proces s vedes of the tree in an order. -3 Jub Postorder traversal-visit all noder in left free and roots! noder and then all right subtreez breez Full binary tree-a tree in every node other leaves have 2 children. -2 Complete binary tree-a tree in every level is completely filled I lever is co and all nodes are left Collection framework - is a set of classes and interfaces that are implemented. -1 2) Given a string you need to find the first non repeating character in that string. You must use a queue to solve the question. Hint: Create a queue of char datatype. Store each character in queue and increase its frequency in another integer array (the size of the array is 26 to count any character from the alphabet). You can access the array using freqArray[ch - 'a']. If ch='b' then its ASCII encoding is 98, and 'a' is 97. So ch-'a' will equal 1 (i.e., 98-97). Examples: Input: a ab c Output: a -1 b b Input: a a c Output: a -1 c 1. (25 points) Give the definition of the following concepts in your own words. Binary search tree - is a rooted free that internat podes each Store a key and have two subtree Preorder traversal the root node visited first, then left subtree then right subtree asceyding Inorder traversal - Proces s vedes of the tree in an order. -3 Jub Postorder traversal-visit all noder in left free and roots! noder and then all right subtreez breez Full binary tree-a tree in every node other leaves have 2 children. -2 Complete binary tree-a tree in every level is completely filled I lever is co and all nodes are left Collection framework - is a set of classes and interfaces that are implemented. -1 2) Given a string you need to find the first non repeating character in that string. You must use a queue to solve the question. Hint: Create a queue of char datatype. Store each character in queue and increase its frequency in another integer array (the size of the array is 26 to count any character from the alphabet). You can access the array using freqArray[ch - 'a']. If ch='b' then its ASCII encoding is 98, and 'a' is 97. So ch-'a' will equal 1 (i.e., 98-97). Examples: Input: a ab c Output: a -1 b b Input: a a c Output: a -1 c