The Mirror of the offer-two-fork Tree

Source: Internet
Author: User

two image of the fork Tree

Title Description
Operates a given two-fork tree and transforms it into a mirror of the source binary tree.
Input Description:
Image definition of binary tree: source binary tree

Problem Solving Ideas:
The left and right sub-tree of the node is converted and then recursively continues.

My Java code is as follows:

/** public
class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    Public TreeNode (int val) {
        this.val = val;
    }
}
*
/public class Solution {public
    void Mirror (TreeNode root) {
        if (null = = root) {
            return;
        } else{
            TreeNode lefttree = root.left;
            Root.left = root.right;
            Root.right = Lefttree;
            Mirror (root.left);
            Mirror (root.right);
            return;}}}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.