面试题28：二叉树的深度

来源：互联网发布：sql增量备份还原编辑：程序博客网时间：2024/05/18 01:53

思路：二叉树的深度等于左右子树的最大深度加1，显然利用递归。

代码：

#include "stdafx.h"#include <iostream>#include <deque>using namespace std;struct BinaryTreeNode{int m_nValue;BinaryTreeNode *m_pLeft;BinaryTreeNode *m_pRight;};//求二叉树的深度int Depth(BinaryTreeNode *pRoot){if (pRoot == NULL){return 0;}int nLeftDepth = Depth(pRoot->m_pLeft);int nRightDepth = Depth(pRoot->m_pRight);return (nLeftDepth > nRightDepth ? nLeftDepth : nRightDepth) + 1;}//以先序的方式构建二叉树，输入-1表示结点为空void CreateBinaryTree(BinaryTreeNode *&pRoot){int nNodeValue = 0;cin >> nNodeValue;if (-1 == nNodeValue){return; }else{pRoot = new BinaryTreeNode();pRoot->m_nValue = nNodeValue;CreateBinaryTree(pRoot->m_pLeft);CreateBinaryTree(pRoot->m_pRight);}}void PrintInOrder(BinaryTreeNode *&pRoot){if (pRoot != NULL){PrintInOrder(pRoot->m_pLeft);cout << pRoot->m_nValue << " ";PrintInOrder(pRoot->m_pRight);}}int _tmain(int argc, _TCHAR* argv[]){BinaryTreeNode *pRoot = NULL;CreateBinaryTree(pRoot);PrintInOrder(pRoot);cout << endl;cout << "二叉树的深度：" << Depth(pRoot) << endl;system("pause");return 0;}

运行结果：