Definition at line 16 of file main.cpp.
◆ lowestCommonAncestor()
Definition at line 19 of file main.cpp.
20 {
21 queue<TreeNode*> process_queue;
22 process_queue.push(root);
23 while (!process_queue.empty())
24 {
25 TreeNode* node = process_queue.front();
26 process_queue.pop();
27
28 if (node == p || node == q)
29 return node;
30
31 int a1 = min(p->
val, q->
val);
32 int a2 = max(p->
val, q->
val);
33
34 if (node->
val > a1 && node->
val < a2)
35 return node;
36
38 process_queue.push(node->
left);
40 process_queue.push(node->
right);
41 }
42 return NULL;
43 }
Definition for a binary tree node.
References TreeNode::left, TreeNode::right, and TreeNode::val.
Referenced by main().
The documentation for this class was generated from the following file: