algorithms/124.cpp at main · snehashish090/algorithms · GitHub

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
61
62
63
64
/**
* Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;

 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),
 right(right) {}
 * };
 *
 */

class FrontierNode {
    TreeNode* node;
    TreeNode* next;

    FrontierNode(TreeNode* node)
    {
        this->node = node;
        this->next = nullptr;
    }
    FrontierNode(TreeNode* node, TreeNode* next)
    {
        this->node = node;
        this->next = next;
    }
};

class QueueFrontier
{
    Node* head;
    Node* tail;

    QueueFrontier(Node* head, Node* tail)
    {
        this->head = head;
        this->tail = tail;
    }
};

class Solution {
public:
    int maxPathSum(TreeNode* root)
    {
        TreeNode* current = root;
        QueueFrontier* frontier =  &QueueFrontier(
            FrontierNode(root),
            FrontierNode(root)
        );
        while (current != nullptr)
        {
            // Defualt Behaviour
            TreeNode* bigger = current->left;
            if (current->left->val > current->right->val)
                bigger = left;
            else
                bigger = right;
        }
        return 0;
    }
};