Round 1
Questions:
- Binary Tree Level Order Traversal - [LeetCode = 102]
- Average of Levels in Binary Tree - LC 637
- Level Order Successor of a Node - Google
- Binary Tree Zigzag Level Order Traversal - LC 103
- Binary Tree Level Order Traversal II - LC 107
- Populating Next Right Pointers in Each Node - LC 116 - Amazon, London
- Binary Tree Right Side View - LC 199 - Amazon, Flipkart
- Cousins in Binary Tree - LC 993
- Symmetric Tree - LC 101 - Amazon, Google, Apple
- Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
- Invert Binary Tree - LC 226 - Google (Many Times)
- Maximum Depth of Binary Tree - LC 104 - Google
- Convert Sorted Array to Binary Search Tree - LC 108
- Flatten Binary Tree to Linked List - LC 114 - Facebook
- Validate Binary Search Tree - LC 98 - Amazon, Google
- Lowest Common Ancestor of a Binary Tree - LC 236 - Amazon
- Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
- Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
- Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
- Path Sum - LC 112 - Amazon
- Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google
- Binary Tree Maximum Path Sum - LC 124 - Facebook
- Path Exists in Binary Tree from Root to Leaf
- Path Exists in Binary Tree at Any Nodes - DFS Using Stack
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: If you want to test your problem-solving skills:
- Q7: Binary Tree Right Side View - LC 199 - Amazon, Flipkart
- Q9: Symmetric Tree - LC 101 - Amazon, Google, Apple
- Q10: Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
- Q17: Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
- Q19: Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
- Q21: Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google
- Q15: Validate Binary Search Tree - LC 98 - Amazon, Google
- Q18: Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
- Q11: Invert Binary Tree - LC 226 - Google (Many Times)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: Amazon-specific order (test yourself here):
- Q18: Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
- Q6: Populating Next Right Pointers in Each Node - LC 116 - Amazon, London
- Q7: Binary Tree Right Side View - LC 199 - Amazon, Flipkart
- Q9: Symmetric Tree - LC 101 - Amazon, Google, Apple
- Q10: Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
- Q15: Validate Binary Search Tree - LC 98 - Amazon, Google
- Q16: Lowest Common Ancestor of a Binary Tree - LC 236 - Amazon
- Q17: Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
- Q19: Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
- Q20: Path Sum - LC 112 - Amazon
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions: Google-specific order (test yourself here):
- Q11: Invert Binary Tree - LC 226 - Google (Many Times)
- Q3: Level Order Successor of a Node - Google
- Q9: Symmetric Tree - LC 101 - Amazon, Google, Apple
- Q10: Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
- Q12: Maximum Depth of Binary Tree - LC 104 - Google
- Q15: Validate Binary Search Tree - LC 98 - Amazon, Google
- Q17: Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
- Q19: Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
- Q21: Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.