Salesforce Software Engineer(Internship) interview questions

Round 1: Given the root node to a binary tree, print each value in the tree breadth-wise. Followup: Print the sum of each layer (depth) of the tree. Round two: Construct a Frequency Stack (push, pop, top). -Push adds an integer to the stack -Pop/top removes/returns all values with the largest frequency in the stack. Write a SQL query to return the 2nd largest value in a table.