Dsa
Binary Search Tree
Hard
Verify BST Symmetry
Given a Binary Search Tree (BST), determine if it is symmetric around its center. A symmetric tree is one where the left subtree is a mirror reflection of the right subtree. The input consists of a pre-order traversal representation of the tree with integers where '-1' indicates a null node. The output should be 'YES' if the tree is symmetric, otherwise 'NO'.
Example Input:
1 2 3 -1 -1 3 2 -1 -1
Example Output:
YES
Key concepts
binary_search_treesymmetrytree_validation
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now