二叉树的深度

来源：互联网发布：fifa18球员数据查询编辑：程序博客网时间：2024/05/10 18:12

题目描述

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

#include <iostream>#include "BinaryTree.h"using namespace std;int TreeDepth(BinaryTreeNode* pRoot){if(pRoot == NULL)return 0;int left = TreeDepth(pRoot ->m_pLeft);int right = TreeDepth (pRoot ->m_pRight);return (left > right) ? left + 1 : right + 1; }

// ====================测试代码====================void Test(BinaryTreeNode* pRoot, int expected){    int result = TreeDepth(pRoot);    if(expected == result)        printf("Test passed.\n");    else        printf("Test failed.\n");}//            1//         /      \//        2        3//       /\         \//      4  5         6//        ///       7void Test1(){    printf("Test1 begins.\n");    BinaryTreeNode* pNode1 = CreateBinaryTreeNode(1);    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);    BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);    ConnectTreeNodes(pNode1, pNode2, pNode3);    ConnectTreeNodes(pNode2, pNode4, pNode5);    ConnectTreeNodes(pNode3, NULL, pNode6);    ConnectTreeNodes(pNode5, pNode7, NULL);    Test(pNode1, 4);    DestroyTree(pNode1);}//               1//              ///             2//            ///           3//          ///         4//        ///       5void Test2(){    printf("Test2 begins.\n");    BinaryTreeNode* pNode1 = CreateBinaryTreeNode(1);    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);    ConnectTreeNodes(pNode1, pNode2, NULL);    ConnectTreeNodes(pNode2, pNode3, NULL);    ConnectTreeNodes(pNode3, pNode4, NULL);    ConnectTreeNodes(pNode4, pNode5, NULL);    Test(pNode1, 5);    DestroyTree(pNode1);}// 1//  \//   2//    \//     3//      \//       4//        \//         5void Test3(){    printf("Test3 begins.\n");    BinaryTreeNode* pNode1 = CreateBinaryTreeNode(1);    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);    ConnectTreeNodes(pNode1, NULL, pNode2);    ConnectTreeNodes(pNode2, NULL, pNode3);    ConnectTreeNodes(pNode3, NULL, pNode4);    ConnectTreeNodes(pNode4, NULL, pNode5);    Test(pNode1, 5);    DestroyTree(pNode1);}// 树中只有1个结点void Test4(){    printf("Test4 begins.\n");    BinaryTreeNode* pNode1 = CreateBinaryTreeNode(1);    Test(pNode1, 1);    DestroyTree(pNode1);}// 树中没有结点void Test5(){    printf("Test5 begins.\n");    Test(NULL, 0);}int main(int argc, char* argv[]){    Test1();    Test2();    Test3();    Test4();    Test5();    return 0;}

0 0