538. Convert BST to Greater Tree

作者: larrymusk | 来源:发表于2017-12-02 11:23 被阅读0次

Leetcode-538Convert BST to Great
Tree
[二叉树BST]!538. Convert BST to Gre
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
Tree 538. Convert BST to Greater

从大往小遍历，并把比当前大的值都累加在当前节点的值上面

struct TreeNode* RML(struct TreeNode* root, int * add) {
    if(root){
        
        RML(root->right, add);
        root->val += *add;
        *add = root->val;
        RML(root->left, add);        
        
    }
    
    return root;
}


struct TreeNode* convertBST(struct TreeNode* root) {
    int add = 0;
    return RML(root, &add);
}

Leetcode-538Convert BST to Great
538. Convert BST to Greater Tree Given a Binary Search Tr...
Tree
538. Convert BST to Greater Tree Given a Binary Search Tr...
[二叉树BST]!538. Convert BST to Gre
题目：538. Convert BST to Greater Tree二叉搜索树。 Given a Binary ...
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree [思路] 该节点的值 = 节点旧值 + 大于此节...
538. Convert BST to Greater Tree
问题描述 Given a Binary Search Tree (BST), convert it to a Gr...
538. Convert BST to Greater Tree
538. Convert BST to Greater Tree
从大往小遍历，并把比当前大的值都累加在当前节点的值上面
538. Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater...
538. Convert BST to Greater Tree
本题的意思其实就是要你求比Node.val大的所有值的和，利用BST是有序的以及在中序遍历下访问到的值任然是有序的...
Tree 538. Convert BST to Greater
这道题让我们将二叉搜索树转为较大树，通过题目汇总的例子可以明白，是把每个结点值加上所有比它大的结点值总和当作新的结...