LintCode 第632题 二叉树的最大节点

//
//  main.cpp
//  LintCode
//
//  Created by xl on 2017/11/30.
//  Copyright © 2017年 xl. All rights reserved.
//

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

typedef char ElemType;

typedef struct BinaryTreeNode{
char value;
struct BinaryTreeNode *lchild,*rchild;
}BinaryTreeNode,*BinaryTree;

BinaryTreeNode * CreatBiTree() {
BinaryTreeNode * node;
char data;
cin>>data;
if (data == '#') {
node = NULL;
} else {
node = (BinaryTreeNode *)malloc(sizeof(BinaryTreeNode));//new BinaryTreeNode;
node->value = data;
node->lchild = CreatBiTree();
node->rchild = CreatBiTree();
}
return node;
}

BinaryTreeNode * currentMaxNode  = new BinaryTreeNode;
void selectMaxNode(BinaryTreeNode *node) {
if (node == NULL) {
return;
}

if (node->value > currentMaxNode->value) {
currentMaxNode->value = node->value;
}
selectMaxNode(node->lchild);
selectMaxNode(node->rchild);
}

int main(int argc, const char * argv[]) {
// insert code here...
std::cout << "Hello, World!\n";

BinaryTreeNode *rootNode =  CreatBiTree();
selectMaxNode(rootNode);
cout<<currentMaxNode->value;
return 0;
}