bad7code的博客

includeincludeusing namespace std;typedef struct treeNode{ int data; struct treeNode *pLeft; struct treeNode *pRight;}treeNode;void printAllPathFromRoot(treeNode *pRoot, list&path){

typedef struct treeNode{ int data; struct treeNode *pLeft; struct treeNode *pRight;}treeNode;void printAllPathWithSum(treeNode *pRoot, int sum, list&path, int ¤tSum){ if(pRoot == NULL){ retur

int getTreeDepth(treeNode *pRoot){ if(pRoot == NULL){ return 0; } int left = getTreeDepth(pRoot->pLeft); int right = getTreeDepth(pRoot->pRight); return left > right ? left+1 : right+1;}bool

共有三种情况：1、两个节点如果一个在左子树，一个在右子树的话，则根节点就是它们的最低父节点2、两个节点全在左子树中3、两个节点全在右子树中#include#include#include#includeusing namespace std;typedef struct treeNode{ int data; struct treeNode *pLeft; s