Tower Research Capital LLC Interview Questions, Process, and Tips

The question asks to construct a k-ary tree using the given k and DFS traversal string.

• Iterate through the DFS traversal string

• If the current character is 'P', create a parent node

• If the current character is 'L', create a leaf node

• Link the nodes according to the DFS traversal order

To determine if a graph has a node with n degree, iterate through all nodes and count their edges.

• Iterate through each node in the graph

• Count the number of edges connected to each node

• If any node has n edges, then the graph has a node with n degree