In the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.

Examples of behavior that contributes to creating a positive environment include:

* Using welcoming and inclusive language

* Being respectful of differing viewpoints and experiences

* Gracefully accepting constructive criticism

* Focusing on what is best for the community

* Showing empathy towards other community members

Examples of unacceptable behavior by participants include:

* The use of sexualized language or imagery and unwelcome sexual attention or advances

* Trolling, insulting/derogatory comments, and personal or political attacks

* Public or private harassment

* Publishing others' private information, such as a physical or electronic address, without explicit permission

* Other conduct which could reasonably be considered inappropriate in a professional setting

Project maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.

Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.

This Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.

This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]

[homepage]: http://contributor-covenant.org

[version]: http://contributor-covenant.org/version/1/4/

I am creating an issue because...

I am creating a pull request for...

- [ ] New algorithm

- [ ] Update to an algorithm

- [ ] Fix an error

- [ ] Other - *Describe below*

public class BinaryTree {

public static TreeNode mirrorTree(TreeNode node){

if(node == null)

return node;

TreeNode left = mirrorTree(node.left);

TreeNode right = mirrorTree(node.right);

node.left = right;

node.right = left;

return node;

}

public static void main(String[] args){

TreeNode root = new TreeNode(8);

TreeNode.insert(root, new TreeNode(31));

TreeNode.insert(root, new TreeNode(45));

TreeNode.insert(root, new TreeNode(16));

TreeNode.insert(root, new TreeNode(24));

TreeNode.insert(root, new TreeNode(19));

TreeNode.insert(root, new TreeNode(29));

TreeNode.insert(root, new TreeNode(7));

StringBuffer inorderbuf=new StringBuffer();

StringBuffer preorderbuf=new StringBuffer();

StringBuffer postorderbuf=new StringBuffer();

TreeTraversal.getInorder(root,inorderbuf);

TreeTraversal.getPreorder(root, preorderbuf);

TreeTraversal.getPostorder(root, postorderbuf);

System.out.println("Before mirroring,In order tree is: "+inorderbuf);

BinaryTree.mirrorTree(root);

StringBuffer inorderbufAfter = new StringBuffer();

TreeTraversal.getInorder(root, inorderbufAfter);

System.out.println("After mirroring,In order tree is: "+inorderbufAfter);

System.out.println("Post order traversal:" + postorderbuf);

System.out.println("Pre order traversal:"+ preorderbuf);

System.out.println("Nodes with no siblings:");

TreeWithNoSiblings.printOnlyLeaves(root);

}

}

public class LowestCommonAncestor {

TreeNode root;

public TreeNode LCA(int p,int q){

return findLCA(root,p,q);

}

private TreeNode findLCA(TreeNode root, int p, int q) {

if(root == null)

return null;

if(root.value == p || root.value == q)

return root;

TreeNode left = findLCA(root.left,p,q);

TreeNode right = findLCA(root.right,p,q);

if(left!=null && right!=null)

return root;

return left!=null? left : right;

}

public static void main(String[] args){

LowestCommonAncestor lca = new LowestCommonAncestor();

TreeNode root = new TreeNode(1);

root.left = new TreeNode(2);

root.right = new TreeNode(3);

root.left.left = new TreeNode(4);

root.left.right = new TreeNode(5);

root.right.left = new TreeNode(6);

root.right.right = new TreeNode(7);

System.out.println("Lowest Common Ancestor of (4,5): "+ lca.findLCA(root, 4, 5).value);

System.out.println("Lowest Common Ancestor of (4,6): "+ lca.findLCA(root, 4, 6).value);

System.out.println("Lowest Common Ancestor of (3,4): "+ lca.findLCA(root, 3, 4).value);

}

}

public class SubTree {

TreeNode root1, root2;

public boolean isIdentical(TreeNode root1,TreeNode root2){

//Since every null tree is also subset of main tree

if(root1==null&&root2==null)

return true;

//Need to check the null condition only once,since we are using recursion at second time it should not be null

if(root1==null&&root2==null)

return false;

return (root1.value==root2.value)&& (isIdentical(root1.left,root2.left))

&&((isIdentical(root1.right,root2.right)) );

}

public boolean isSubTree(TreeNode p, TreeNode q){

//Since every null tree is also subset of main tree

if(q==null)

return true;

if(p==null)

return false;

if(isIdentical(p,q))

return true;

return isSubTree(p.left,q)||isSubTree(p.right,q);

}

public static void main(String[] args) {

SubTree tree = new SubTree();

TreeNode root1 = new TreeNode(26);

root1.right = new TreeNode(3);

root1.right.right = new TreeNode(3);

root1.left = new TreeNode(10);

root1.left.left = new TreeNode(4);

root1.left.left.right = new TreeNode(30);

root1.left.right = new TreeNode(6);

TreeNode root2 = new TreeNode(10);

root2.right = new TreeNode(6);

root2.left = new TreeNode(4);

root2.left.right = new TreeNode(30);

if(tree.isSubTree(tree.root1,tree.root2))

System.out.println("Tree2 is subtree of Tree1");

else

System.out.println("Tree2 is not a subtree of Tree1");

}

}