JobsJob TrackerJob alerts

Infybeam · 14 questions

All 14Coding 11Low-Level Design 1
  • Construct Tree from Inorder and PreorderCoding
  • Detect and Remove Loop in a Linked ListCoding
  • N Queen ProblemCoding
  • Sort an array of 0s, 1s and 2sCoding
  • Dijkstra’s algorithmCoding
  • Detect loop in linked list and find loop start pointCoding
  • Sort an unsorted array containing only 0, 1, and 2Coding
  • 8 Queens ProblemCoding
  • Identify the heavy coin bag among 100 bags
  • Swap variables using pointers function argumentsCoding
  • 4 persons and a torch light puzzle
  • Find pair in array with sum equal to kCoding
  • Find mirror node in binary tree with parent pointersCoding
  • Singleton design pattern and thread-safetyLow-Level Design
← Infybeam questions
  1. Interview questions
  2. Infybeam
  3. Find mirror node in binary tree with parent pointers
Coding

Find mirror node in binary tree with parent pointers

Filed under Infybeam

The question

Given a binary tree where nodes have left, right, and parent pointers, return the mirror node given a pointer to any node. Discuss what changes if the root pointer is not given.

No write-up yet. Related questions below have one.

Related Infybeam questions

  • Construct Tree from Inorder and Preorder
  • Detect loop in linked list and find loop start point
  • Sort an unsorted array containing only 0, 1, and 2
  • Swap variables using pointers function arguments
  • Find pair in array with sum equal to k
← Find pair in array with sum equal to kSingleton design pattern and thread-safety →

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