← Barclays questions

Inorder Traversal, Graph Traversal, and Parenthesis Validation

Filed under Barclays

Implement binary tree inorder traversal, explain Graph DFS and BFS algorithms, and use a stack data structure to validate a string containing matching parentheses.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Barclays questions

Collected from public candidate posts and coding forums. Updated Nov 2026.