Evaluate the postfix expression below. Note the answer should be an integer! 5 6 3 +...

   

Transcribed Image Text:

Evaluate the postfix expression below. Note the answer should be an integer! 5 6 3 + 5 -* Convert the infix expression to a postfix expression with a single space between each operator or operand (ex: 43-), using the algorithm given in class. 3+1/9*5 Given the binary tree, provide the absolute value of the balance for the nodes listed. Do not provide a negative number for any answers root R 1 / left H left F right J 1 right V / left S left B right C What is the balance of the subtree under node V? What is the balance of the subtree under node R? What is the balance of the subtree under node H? Select all nodes in the BST below which are out of order. 1 left C 1 left B root G left A right E 1 1 right F right H / left D Given the array below at the start of a pass through data in the bubblesort algorithm: 21 27 29 16 31 41 28 30 What are the eight values in the array after 1 complete pass through the inner loop of the algorithm. Given the array: 18 17 9 14 22 11 3 The insertion sort algorithm has already performed 3 iterations, making 9 the next number to be processed. List all numbers after the next iteration of the algorithm. Evaluate the postfix expression below. Note the answer should be an integer! 5 6 3 + 5 -* Convert the infix expression to a postfix expression with a single space between each operator or operand (ex: 43-), using the algorithm given in class. 3+1/9*5 Given the binary tree, provide the absolute value of the balance for the nodes listed. Do not provide a negative number for any answers root R 1 / left H left F right J 1 right V / left S left B right C What is the balance of the subtree under node V? What is the balance of the subtree under node R? What is the balance of the subtree under node H? Select all nodes in the BST below which are out of order. 1 left C 1 left B root G left A right E 1 1 right F right H / left D Given the array below at the start of a pass through data in the bubblesort algorithm: 21 27 29 16 31 41 28 30 What are the eight values in the array after 1 complete pass through the inner loop of the algorithm. Given the array: 18 17 9 14 22 11 3 The insertion sort algorithm has already performed 3 iterations, making 9 the next number to be processed. List all numbers after the next iteration of the algorithm.

Answer rating: 100% (QA)

1 To evaluate the postfix expression a stack based approach can be used as follows Start scanning the expression from left to right When an operand in this case numbers is encountered push then onto t... View the full answer