Tally Solutions SDE Interview Questions and Answers

Solve medium Leetcode DS problems, that should be enough to crack.

Q1. Print RIght view of a binary tree, create a tree, and run all possible test cases.
Ans. 
Print the right view of a binary tree and create a tree.
• Traverse the tree using DFS and keep track of the maximum level seen so far.

• Print the node value whenever a new level is reached.

• Create a binary tree by defining a Node class with left and right child pointers.

• Test cases: single node, complete binary tree, skewed tree, null tree.
Answered by AI
Add your answer
Q2. Other questions were related to first one only, different scenarios were discussed.
Add your answer