Given the inorder and preorder traversals in a Binary Tree (not a Binary Search Tree) recreate the tree from the traversals. Now do a breadth-first traversal of that tree and list the nodes. Inorder Traversal: 4, 2, 1, 7, 5, 8, 3, 6

Preorder Traversal: 1, 2, 4, 3, 5, 7, 8, 6

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest value. you may assume there is at least one value. (cascading/streaming logic, basic string processing)

How are we able to create photographs differently than 100 years ago? explain your answer in relation to your photograph you selected.

Retype the statements, correcting the syntax errors. system.out.println("num: " + songnum); system.out.println(int songnum); system.out.println(songnum " songs"); note: these activities may test code with different test values. this activity will perform two tests: the first with songnum = 5, the second with songnum = 9. see how to use zybooks.