Tree traversals and infix to postfix
Filed under Societe Generale
The question
Explain pre-order, in-order, and post-order tree traversals, convert a small infix expression to postfix, and discuss searching in a BST along with BFS vs DFS.
No write-up yet. Related questions below have one.
Related Societe Generale questions
Collected from public candidate posts and coding forums. Updated Nov 2026.