Fasttttt answer within 30 minutes.... will upvote Symmetric Tree Description Check whether a given tree is a mirror image of itself and symmetric about its root node. Input No input from stdin. Output The function you code must return a boolean true if the tree is a mirror image of itself. Otherwise, it must return false. class Node { int key; Node left, right; Node(int item) { key = item; left = right = null; } } class Source { Node root; boolean isMirror(Node node1, Node node2) { /* Write your code here */ } public static void main(String args[]) { Source tree = new Source(); tree.root = new Node(1); tree.root.left = new Node(2); tree.root.right = new Node(2); tree.root.left.left = new Node(7); tree.root.left.right = new Node(5); tree.root.right.left = new Node(5); tree.root.right.right = new Node(7); boolean output = tree.isMirror(tree.root, tree.root); if (output == true) System.out.println("1"); else System.out.println("0"); } }
Fasttttt answer within 30 minutes.... will upvote
Symmetric Tree
Description
Check whether a given tree is a mirror image of itself and symmetric about its root node.
Input
No input from stdin.
Output
The function you code must return a boolean true if the tree is a mirror image of itself. Otherwise, it must return false.
class Node
{
int key;
Node left, right;
Node(int item)
{
key = item;
left = right = null;
}
}
class Source
{
Node root;
boolean isMirror(Node node1, Node node2)
{
/* Write your code here */
}
public static void main(String args[])
{
Source tree = new Source();
tree.root = new Node(1);
tree.root.left = new Node(2);
tree.root.right = new Node(2);
tree.root.left.left = new Node(7);
tree.root.left.right = new Node(5);
tree.root.right.left = new Node(5);
tree.root.right.right = new Node(7);
boolean output = tree.isMirror(tree.root, tree.root);
if (output == true)
System.out.println("1");
else
System.out.println("0");
}
}
Step by step
Solved in 2 steps with 1 images
