Contents
How do you compare two binary search trees?
Two binary search trees are given. They are equal if they contains the same set of values( they can have different structure.) The equality can be tested by using inorder traversal of one BST and then validating the inorder sequence with the second BST.
Is similar binary tree?
Two binary trees are identical if: their root nodes have the same value, their left subtree is identical, their right subtree is identical.
Is Mirror binary tree?
Given two Binary Trees, write a function that returns true if two trees are mirror of each other, else false. For example, the function should return true for following input trees. Left subtree of root of ‘a’ and right subtree root of ‘b’ are mirror. Right subtree of ‘a’ and left subtree of ‘b’ are mirror.
How do you find the mirror image of a binary tree?
Given a binary tree, write an efficient algorithm to convert the binary tree into its mirror. The idea is simple – traverse the tree in a postorder fashion, and for every node, swap its left and right child pointer after recursively converting its left and right subtree to mirror first.
Can two different trees have the same inorder traversal?
both have an inorder traversal of a b c d e . They are, in fact, rotations, an operation which preserves inorder traversal. But if inorder and preorder traversals are same then the trees are equal.
How do you check if a binary tree is a mirror image on left and right sub trees?
The following steps are involved in the recursive approach:
- If the tree is empty, then it is symmetrical to the vertical axis going through its root node.
- Else, check if the value at the root node of both subtrees is the same.
- If it is, then check if the left subtree and the right subtree are symmetrical.
How can one convert a binary tree into its mirror image?
In order to change the original tree in its mirror tree, then we simply swap the left and right link of each node.