PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 28 · 5 min readIterative Tree Traversal: Turning Recursion Into an Explicit Stack You can write recursive inorder in your sleep. Three lines and a base case. Then an interviewer asks for the iterative version, and the clean recursion you leaned on becomes a puzzle about when to pus00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 26 · 11 min readBinary Tree Recursion Patterns Mapped to Information Flow You've solved 50 tree problems. You know what preorder, postorder, inorder, and level order mean. On problem 51 your interviewer hands you something unfamiliar and you have 35 minutes. You sketch the 00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 25 · 10 min readBinary tree Interview Questions: 6 Patterns Behind Every FAANG ProblemYou sort LeetCode's tree tag by frequency, pick the top forty, and start grinding. Three weeks in, tree problems still feel unpredictable. The recursive ones blur together. Level order problems feel l00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 25 · 10 min readBinary Search Tree Time Complexity: Why O(log n) Isn't GuaranteedYou learn that a binary search tree gives you O(log n) search, insertion, and deletion. Then you feed it a sorted array of timestamps from a log and the tree degenerates into a linked list. Every sear00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 23 · 9 min readBig O Notation Explained: Growth Rate, Not Operation CountYou've read three Big O articles this week. You can recite that hash map lookups are O(1) amortised, that merge sort is O(n log n), that nested loops are O(n²). Then your interviewer writes a function10
