/**
 * Definition of SegmentTreeNode:
 * class SegmentTreeNode {
 * public:
 *     int start, end, max;
 *     SegmentTreeNode *left, *right;
 *     SegmentTreeNode(int start, int end, int max) {
 *         this->start = start;
 *         this->end = end;
 *         this->max = max;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
#define INF 0x7fffffff
class Solution {
public:
    /**
     *@param root, index, value: The root of segment tree and 
     *@ change the node's value with [index, index] to the new given value
     *@return: void
     */
    void modify(SegmentTreeNode *root, int index, int value) {
        // write your code here
        
        if(root == NULL) { return; }
        if(root->start == root->end && root->start == index) {
            root->max = value;
            return;
        }
        
        int mid = (root->start + root->end) >> 1;
        
        if(index <= mid) {
            modify(root->left, index, value);
        } else {
            modify(root->right, index, value);
        }
        
        //root->left一定存在，root->right不一定存在。需要判斷
        root->max = max(root->left->max, root->right ? root->right->max : -INF);
    }
};