Repository navigation
Expand file tree
/
Copy pathQ47-FindCommonAncester.cpp
More file actions
63 lines (56 loc) · 1.79 KB
/
Copy pathQ47-FindCommonAncester.cpp
File metadata and controls
63 lines (56 loc) · 1.79 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//
// Q47-FindCommonAncester.cpp
// Algorithm-Linux
//
// Created by Sanqiang Zhao on 12/11/12.
// Copyright (c) 2012 Sanqiang Zhao. All rights reserved.
//
#include "Q47-FindCommonAncester.h"
/*
BinaryTreeNode<int> *btn3 = new BinaryTreeNode<int>(3);
BinaryTreeNode<int> *btn7 = new BinaryTreeNode<int>(7);
BinaryTreeNode<int> *btn12 = new BinaryTreeNode<int>(12);
BinaryTreeNode<int> *btn17= new BinaryTreeNode<int>(17);
BinaryTreeNode<int> *btn5 = new BinaryTreeNode<int>(5, btn3, btn7);
BinaryTreeNode<int> *btn15 = new BinaryTreeNode<int>(15, btn12, btn17);
BinaryTreeNode<int> *btn10 = new BinaryTreeNode<int>(10, btn5, btn15);
cout<<findCommonAncester(btn10, btn3, btn5)->Data;
*/
BinaryTreeNode<int> * findCommonAncester(BinaryTreeNode<int> * root, BinaryTreeNode<int> * p, BinaryTreeNode<int> *q)
{
CommonAncesterWrapper *result = findCommonAncesterHelper(root, p, q);
if (result->find) {
return result->node;
}
return NULL;
}
CommonAncesterWrapper * findCommonAncesterHelper(BinaryTreeNode<int> * root, BinaryTreeNode<int> * p, BinaryTreeNode<int> *q)
{
if (!root) {
CommonAncesterWrapper *w = new CommonAncesterWrapper();
return w;
}
CommonAncesterWrapper *l = findCommonAncesterHelper(root->LeftChild, p, q);
if (l->find) {
return l;
}
CommonAncesterWrapper *r = findCommonAncesterHelper(root->RightChild, p, q);
if (r->find) {
return r;
}
CommonAncesterWrapper *w = new CommonAncesterWrapper();
if (l->node && r->node) {
w->node = root;
w->find = true;
return w;
}else if(root == p || root == q)
{
w->node = root;
w->find = l->node || r->node;
return w;
}else
{
w->node = l->node?l->node:r->node;
return w;
}
}