medium10 pts · first answer countsgraphsbinary-treesrecursion
Checking if a tree is a mirror of itself
To check if a binary tree is symmetric, you compare two subtrees a and b as mirrors. Which pairs must you compare next?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of plain recursive FibonacciBackend Developer
- Recursion with no base caseBackend Developer
- Hidden memory cost of recursionBackend Developer
- Edges in a tree with n nodesBackend Developer
- Most nodes in a binary tree of height 3Backend Developer
- What inorder traversal of a BST givesBackend Developer
- Preorder output of a small treeBackend Developer
- Traversal for freeing a whole treeBackend Developer