Binary Tree FAANG Questions

Round 1

Questions:

1. Binary Tree Level Order Traversal - [LeetCode = 102]
2. Average of Levels in Binary Tree - LC 637
3. Level Order Successor of a Node - Google
4. Binary Tree Zigzag Level Order Traversal - LC 103
5. Binary Tree Level Order Traversal II - LC 107
6. Populating Next Right Pointers in Each Node - LC 116 - Amazon, London
7. Binary Tree Right Side View - LC 199 - Amazon, Flipkart
8. Cousins in Binary Tree - LC 993
9. Symmetric Tree - LC 101 - Amazon, Google, Apple
10. Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
11. Invert Binary Tree - LC 226 - Google (Many Times)
12. Maximum Depth of Binary Tree - LC 104 - Google
13. Convert Sorted Array to Binary Search Tree - LC 108
14. Flatten Binary Tree to Linked List - LC 114 - Facebook
15. Validate Binary Search Tree - LC 98 - Amazon, Google
16. Lowest Common Ancestor of a Binary Tree - LC 236 - Amazon
17. Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
18. Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
19. Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
20. Path Sum - LC 112 - Amazon
21. Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google
22. Binary Tree Maximum Path Sum - LC 124 - Facebook
23. Path Exists in Binary Tree from Root to Leaf
24. Path Exists in Binary Tree at Any Nodes
25. DFS Using Stack Implementation

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.

---

Round 2

Questions:

1. Binary Tree Right Side View - LC 199 - Amazon, Flipkart
2. Symmetric Tree - LC 101 - Amazon, Google, Apple
3. Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
4. Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
5. Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
6. Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google
7. Validate Binary Search Tree - LC 98 - Amazon, Google
8. Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
9. Invert Binary Tree - LC 226 - Google (Many Times)

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.

---

Round 3

Questions:

1. Construct Binary Tree from Preorder and Inorder Traversal - LC 105 - Amazon (Many Times)
2. Populating Next Right Pointers in Each Node - LC 116 - Amazon, London
3. Binary Tree Right Side View - LC 199 - Amazon, Flipkart
4. Symmetric Tree - LC 101 - Amazon, Google, Apple
5. Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
6. Validate Binary Search Tree - LC 98 - Amazon, Google
7. Lowest Common Ancestor of a Binary Tree - LC 236 - Amazon
8. Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
9. Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
10. Path Sum - LC 112 - Amazon

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.

---

Round 4

Questions:

1. Invert Binary Tree - LC 226 - Google (Many Times)
2. Level Order Successor of a Node - Google
3. Symmetric Tree - LC 101 - Amazon, Google, Apple
4. Diameter of Binary Tree - LC 543 - Google, Amazon, Facebook
5. Maximum Depth of Binary Tree - LC 104 - Google
6. Validate Binary Search Tree - LC 98 - Amazon, Google
7. Kth Smallest Element in a BST - LC 230 - Facebook, Amazon, Google
8. Serialize and Deserialize Binary Tree - LC 297 - Google, Facebook, Amazon
9. Sum Root to Leaf Numbers - LC 129 - Microsoft, Apple, Google

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.

---

Round 5

Questions:

1. Facebook Specific:
   • Q1, Q4, Q6, Q12, Q13, Q16, Q18, Q21

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.

---