【面试题十九】二叉树的镜像

最新推荐文章于 2013-12-11 22:12:00 发布
最新推荐文章于 2013-12-11 22:12:00 发布
阅读量623 收藏
点赞数
分类专栏： 剑指offer 剑指offer
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/zling_1989/article/details/17081081
版权

二叉树的镜像


这道题很简单就是交换结点，利用递归解解决问题思路清晰，代码简洁；


MirrorTree.cpp:

#include <iostream>
#include <cstdio>
#include <stack>
#include "BinaryTree.h"

using namespace std;

void MirrorRecursively(BinaryTreeNode *pNode)
{
    if((pNode == NULL) || (pNode->m_pLeft == NULL && pNode->m_pRight))
    {
        return ;
    }

    BinaryTreeNode* pTemp = pNode->m_pLeft;
    pNode->m_pLeft = pNode->m_pRight;
    pNode->m_pRight = pTemp;

    if(pNode->m_pLeft)
    {
        MirrorRecursively(pNode->m_pLeft);
    }
    if(pNode->m_pRight)
    {
        MirrorRecursively(pNode->m_pRight);
    }
}

void MirrorIteratively(BinaryTreeNode* pRoot)
{
    if(pRoot == NULL)
    {
        return ;
    }

    stack<BinaryTreeNode *> stackTreeNode;
    stackTreeNode.push(pRoot);

    while(stackTreeNode.size() > 0)
    {
        BinaryTreeNode* pNode = stackTreeNode.top();
        stackTreeNode.pop();

        BinaryTreeNode* pTemp = pNode->m_pLeft;
        pNode->m_pLeft = pNode->m_pRight;
        pNode->m_pRight = pTemp;

        if(pNode->m_pLeft)
        {
            stackTreeNode.push(pNode->m_pLeft);
        }
        if(pNode->m_pRight)
        {
            stackTreeNode.push(pNode->m_pRight);
        }
    }
}

// ====================测试代码====================
// 测试完全二叉树：除了叶子节点，其他节点都有两个子节点
//            8
//        6      10
//       5 7    9  11
void Test1()
{
    printf("=====Test1 starts:=====\n");
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
    BinaryTreeNode* pNode10 = CreateBinaryTreeNode(10);
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);
    BinaryTreeNode* pNode9 = CreateBinaryTreeNode(9);
    BinaryTreeNode* pNode11 = CreateBinaryTreeNode(11);

    ConnectTreeNodes(pNode8, pNode6, pNode10);
    ConnectTreeNodes(pNode6, pNode5, pNode7);
    ConnectTreeNodes(pNode10, pNode9, pNode11);

    PrintTree(pNode8);

    printf("=====Test1: MirrorRecursively=====\n");
    MirrorRecursively(pNode8);
    PrintTree(pNode8);

    printf("=====Test1: MirrorIteratively=====\n");
    MirrorIteratively(pNode8);
    PrintTree(pNode8);

    DestroyTree(pNode8);
}

// 测试二叉树：出叶子结点之外，左右的结点都有且只有一个左子结点
//            8
//          7   
//        6 
//      5
//    4
void Test2()
{
    printf("=====Test2 starts:=====\n");
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
    BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);
    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);

    ConnectTreeNodes(pNode8, pNode7, NULL);
    ConnectTreeNodes(pNode7, pNode6, NULL);
    ConnectTreeNodes(pNode6, pNode5, NULL);
    ConnectTreeNodes(pNode5, pNode4, NULL);

    PrintTree(pNode8);

    printf("=====Test2: MirrorRecursively=====\n");
    MirrorRecursively(pNode8);
    PrintTree(pNode8);

    printf("=====Test2: MirrorIteratively=====\n");
    MirrorIteratively(pNode8);
    PrintTree(pNode8);

    DestroyTree(pNode8);
}

// 测试二叉树：出叶子结点之外，左右的结点都有且只有一个右子结点
//            8
//             7   
//              6 
//               5
//                4
void Test3()
{
    printf("=====Test3 starts:=====\n");
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
    BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);
    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);

    ConnectTreeNodes(pNode8, NULL, pNode7);
    ConnectTreeNodes(pNode7, NULL, pNode6);
    ConnectTreeNodes(pNode6, NULL, pNode5);
    ConnectTreeNodes(pNode5, NULL, pNode4);

    PrintTree(pNode8);

    printf("=====Test3: MirrorRecursively=====\n");
    MirrorRecursively(pNode8);
    PrintTree(pNode8);

    printf("=====Test3: MirrorIteratively=====\n");
    MirrorIteratively(pNode8);
    PrintTree(pNode8);

    DestroyTree(pNode8);
}

// 测试空二叉树：根结点为空指针
void Test4()
{
    printf("=====Test4 starts:=====\n");
    BinaryTreeNode* pNode = NULL;

    PrintTree(pNode);

    printf("=====Test4: MirrorRecursively=====\n");
    MirrorRecursively(pNode);
    PrintTree(pNode);

    printf("=====Test4: MirrorIteratively=====\n");
    MirrorIteratively(pNode);
    PrintTree(pNode);
}

// 测试只有一个结点的二叉树
void Test5()
{
    printf("=====Test5 starts:=====\n");
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);

    PrintTree(pNode8);

    printf("=====Test4: MirrorRecursively=====\n");
    MirrorRecursively(pNode8);
    PrintTree(pNode8);

    printf("=====Test4: MirrorIteratively=====\n");
    MirrorIteratively(pNode8);
    PrintTree(pNode8);
}


int main()
{
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();

    return 0;
}


BinaryTree.h:

#ifndef _BINARY_TREE_H_
#define _BINARY_TREE_H_

struct BinaryTreeNode 
{
    int                    m_nValue; 
    BinaryTreeNode*        m_pLeft;  
    BinaryTreeNode*        m_pRight; 
};

BinaryTreeNode* CreateBinaryTreeNode(int value);
void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight);
void PrintTreeNode(BinaryTreeNode* pNode);
void PrintTree(BinaryTreeNode* pRoot);
void DestroyTree(BinaryTreeNode* pRoot);


#endif /*_BINARY_TREE_H_*/


BinaryTree.cpp:

#include <iostream>
#include "BinaryTree.h"
#include <cstdio>

BinaryTreeNode* CreateBinaryTreeNode(int value)
{
    BinaryTreeNode* pNode = new BinaryTreeNode();
    pNode->m_nValue = value;
    pNode->m_pLeft = NULL;
    pNode->m_pRight = NULL;

    return pNode;
}

void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight)
{
    if(pParent != NULL)
    {
        pParent->m_pLeft = pLeft;
        pParent->m_pRight = pRight;
    }
}

void PrintTreeNode(BinaryTreeNode* pNode)
{
    if(pNode != NULL)
    {
        printf("value of this node is: %d\n", pNode->m_nValue);

        if(pNode->m_pLeft != NULL)
            printf("value of its left child is: %d.\n", pNode->m_pLeft->m_nValue);
        else
            printf("left child is null.\n");

        if(pNode->m_pRight != NULL)
            printf("value of its right child is: %d.\n", pNode->m_pRight->m_nValue);
        else
            printf("right child is null.\n");
    }
    else
    {
        printf("this node is null.\n");
    }

    printf("\n");
}

void PrintTree(BinaryTreeNode* pRoot)
{
    PrintTreeNode(pRoot);

    if(pRoot != NULL)
    {
        if(pRoot->m_pLeft != NULL)
            PrintTree(pRoot->m_pLeft);

        if(pRoot->m_pRight != NULL)
            PrintTree(pRoot->m_pRight);
    }
}

void DestroyTree(BinaryTreeNode* pRoot)
{
    if(pRoot != NULL)
    {
        BinaryTreeNode* pLeft = pRoot->m_pLeft;
        BinaryTreeNode* pRight = pRoot->m_pRight;

        delete pRoot;
        pRoot = NULL;

        DestroyTree(pLeft);
        DestroyTree(pRight);
    }
}


Makefile:

.PHONY:clean
CPP=g++
CFLAGS=-Wall -g
BIN=test
OBJS=MirrorTree.o BinaryTree.o
LIBS=
$(BIN):$(OBJS)
	$(CPP) $(CFLAGS) $^ -o $@ $(LIBS)
%.o:%.cpp
	$(CPP) $(CFLAGS) -c $< -o $@
clean:
	rm -f *.o $(BIN)


运行结果：

=====Test1 starts:=====
value of this node is: 8
value of its left child is: 6.
value of its right child is: 10.

value of this node is: 6
value of its left child is: 5.
value of its right child is: 7.

value of this node is: 5
left child is null.
right child is null.

value of this node is: 7
left child is null.
right child is null.

value of this node is: 10
value of its left child is: 9.
value of its right child is: 11.

value of this node is: 9
left child is null.
right child is null.

value of this node is: 11
left child is null.
right child is null.

=====Test1: MirrorRecursively=====
value of this node is: 8
value of its left child is: 10.
value of its right child is: 6.

value of this node is: 10
value of its left child is: 11.
value of its right child is: 9.

value of this node is: 11
left child is null.
right child is null.

value of this node is: 9
left child is null.
right child is null.

value of this node is: 6
value of its left child is: 7.
value of its right child is: 5.

value of this node is: 7
left child is null.
right child is null.

value of this node is: 5
left child is null.
right child is null.

=====Test1: MirrorIteratively=====
value of this node is: 8
value of its left child is: 6.
value of its right child is: 10.

value of this node is: 6
value of its left child is: 5.
value of its right child is: 7.

value of this node is: 5
left child is null.
right child is null.

value of this node is: 7
left child is null.
right child is null.

value of this node is: 10
value of its left child is: 9.
value of its right child is: 11.

value of this node is: 9
left child is null.
right child is null.

value of this node is: 11
left child is null.
right child is null.

=====Test2 starts:=====
value of this node is: 8
value of its left child is: 7.
right child is null.

value of this node is: 7
value of its left child is: 6.
right child is null.

value of this node is: 6
value of its left child is: 5.
right child is null.

value of this node is: 5
value of its left child is: 4.
right child is null.

value of this node is: 4
left child is null.
right child is null.

=====Test2: MirrorRecursively=====
value of this node is: 8
left child is null.
value of its right child is: 7.

value of this node is: 7
left child is null.
value of its right child is: 6.

value of this node is: 6
left child is null.
value of its right child is: 5.

value of this node is: 5
left child is null.
value of its right child is: 4.

value of this node is: 4
left child is null.
right child is null.

=====Test2: MirrorIteratively=====
value of this node is: 8
value of its left child is: 7.
right child is null.

value of this node is: 7
value of its left child is: 6.
right child is null.

value of this node is: 6
value of its left child is: 5.
right child is null.

value of this node is: 5
value of its left child is: 4.
right child is null.

value of this node is: 4
left child is null.
right child is null.

=====Test3 starts:=====
value of this node is: 8
left child is null.
value of its right child is: 7.

value of this node is: 7
left child is null.
value of its right child is: 6.

value of this node is: 6
left child is null.
value of its right child is: 5.

value of this node is: 5
left child is null.
value of its right child is: 4.

value of this node is: 4
left child is null.
right child is null.

=====Test3: MirrorRecursively=====
value of this node is: 8
left child is null.
value of its right child is: 7.

value of this node is: 7
left child is null.
value of its right child is: 6.

value of this node is: 6
left child is null.
value of its right child is: 5.

value of this node is: 5
left child is null.
value of its right child is: 4.

value of this node is: 4
left child is null.
right child is null.

=====Test3: MirrorIteratively=====
value of this node is: 8
value of its left child is: 7.
right child is null.

value of this node is: 7
value of its left child is: 6.
right child is null.

value of this node is: 6
value of its left child is: 5.
right child is null.

value of this node is: 5
value of its left child is: 4.
right child is null.

value of this node is: 4
left child is null.
right child is null.

=====Test4 starts:=====
this node is null.

=====Test4: MirrorRecursively=====
this node is null.

=====Test4: MirrorIteratively=====
this node is null.

=====Test5 starts:=====
value of this node is: 8
left child is null.
right child is null.

=====Test4: MirrorRecursively=====
value of this node is: 8
left child is null.
right child is null.

=====Test4: MirrorIteratively=====
value of this node is: 8
left child is null.
right child is null.


CodeMyDream
关注
专栏目录
剑指offer面试题27. 二叉树的镜像(递归)
01-20
题目描述 请完成一个函数，输入一个二叉树，该函数输出它的镜像。 原创文章 264获赞 696访问量 3万+ 关注 私信 展开阅读全文 作者：程旭员
java基础面试题二叉树的镜像
最新发布
11-12
java基础面试题二叉树的镜像本资源系百度网盘分享地址
剑指offer算法实现java版——面试题19二叉树的镜像
03-14
我们可以画一棵二叉树，然后画出该二叉树的镜像。画完图之后我们会发现，所谓“二叉树的镜像”就是把二叉树中所有子树的左孩子和右孩子进行交换。因此需要遍历二叉树所有的结点，在遍历的同时交换非叶子结点的左右...
二叉树面试题目总结 全
09-07
另外，交换二叉树左右子树（即生成二叉树的镜像）也是一个基本操作。 在二叉树中查找某个节点，判断节点是否存在，以及找到节点的最近公共祖先，都是面试中可能遇到的题目。最近公共祖先问题有两种解法，一种是递归...
【面试题四】c/c++字符串，替换空格
zling_1989的专栏
11-30 3189
替换空格
【面试题一的补充】C++ MyString类的封装
zling_1989的专栏
11-30 1815
一，C++ MyString类的封装
【面试题一】类型转换关键字，空类对象模型，拷贝构造函数，赋值运算符函数
zling_1989的专栏
11-30 1423
在C++中，有哪4个与类型转换相关的关键字？ n多书里面推荐要养成使用转型关键字的习惯，几年过去了，感觉还是不习惯，C风格的转型操作实在太强大太方便了。 1、const_cast 号称唯一具有常量性移除的转型操作符，这个说法实在很废话，不解释。平时几乎没有用过，遇到需要这个关键字的时候，都是直接修改了接口的类型，也不会去用这个关键字，一般来说老接口设计有问题啊。明明是const的，非得转成n
【面试题二】java实现的单例模式，c++实现单例模式，实现禁止拷贝
zling_1989的专栏
11-30 1160
一，c++实现单例模式
【面试题二十三】从上往下打印二叉树
zling_1989的专栏
12-11 1081
从上往下打印二叉树
【面试题十二】打印1到最大的n位数
zling_1989的专栏
12-01 1067
打印1到最大的n位数
【面试题二十五】二叉树中和为某一值的路径
zling_1989的专栏
12-11 973
二叉树中和为某一值的路径 只有前序遍历，首先访问根结点。
【面试题三】c数组做为参数退化的问题，二维数组中的查找
zling_1989的专栏
11-30 833
二维数组中的查找
【面试题五】从尾到头打印链表
zling_1989的专栏
11-30 828
从尾到头打印链表
【面试题二十一】包含min函数的栈
zling_1989的专栏
12-02 761
包含min函数的栈 MinStack.cpp: #include #include "StackWithMin.h" #include using namespace std; void Test(char* testName, const StackWithMin& stack, int expected) { if(testName != NULL) pri
【面试题十七】合并两个排序的链表
zling_1989的专栏
12-01 755
合并两个排序的链表
【面试题六】重建二叉树
zling_1989的专栏
11-30 742
重建二叉树
【面试题二十二】栈的压入、弹出序列
zling_1989的专栏
12-11 691
栈的压入、弹出序列 如果所有的数字都压入栈了仍然没有找到下一个弹出的数字，
【面试题九】斐波那契数列
zling_1989的专栏
12-01 678
斐波那契数列
数据结构面试题精解
"《数据结构面试题大全》涵盖了丰富的数据结构和算法问题，旨在帮助读者应对各类面试场景，包括但不限于二元查找树的转化、数组和链表的操作、树的遍历、堆的运用、字符串处理、递归与非递归算法等。" 在本书中，...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值