_{[0513 - Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0513-find-bottom-left-tree-value.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0513-find-bottom-left-tree-value.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0669 - Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0669-trim-a-binary-search-tree.go)</div>} | _{<divalign='center'>[✔️](java%2F0669-trim-a-binary-search-tree.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0669-trim-a-binary-search-tree.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0669-trim-a-binary-search-tree.kt)</div>} | _{<divalign='center'>[✔️](python%2F0669-trim-a-binary-search-tree.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0669-trim-a-binary-search-tree.ts)</div>}

_{[0173 - Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0173-binary-search-tree-iterator.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0173-binary-search-tree-iterator.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0173-binary-search-tree-iterator.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0538 - Convert Bst to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0538-convert-bst-to-greater-tree.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0538 - Convert Bst to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0538-convert-bst-to-greater-tree.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0538-convert-bst-to-greater-tree.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0124 - Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)} | _{<div align='center'>[✔️](c%2F0124-binary-tree-maximum-path-sum.c)</div>} | _{<div align='center'>[✔️](cpp%2F0124-binary-tree-maximum-path-sum.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0124-binary-tree-maximum-path-sum.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0124-binary-tree-maximum-path-sum.go)</div>} | _{<div align='center'>[✔️](java%2F0124-binary-tree-maximum-path-sum.java)</div>} | _{<div align='center'>[✔️](javascript%2F0124-binary-tree-maximum-path-sum.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0124-binary-tree-maximum-path-sum.kt)</div>} | _{<div align='center'>[✔️](python%2F0124-binary-tree-maximum-path-sum.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F0124-binary-tree-maximum-path-sum.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0124-binary-tree-maximum-path-sum.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0124-binary-tree-maximum-path-sum.ts)</div>}

_{[0297 - Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)} | _{<div align='center'>[✔️](c%2F0297-serialize-and-deserialize-binary-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0297-serialize-and-deserialize-binary-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0297-serialize-and-deserialize-binary-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0297-serialize-and-deserialize-binary-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0297-serialize-and-deserialize-binary-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0297-serialize-and-deserialize-binary-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0297-serialize-and-deserialize-binary-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0297-serialize-and-deserialize-binary-tree.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0297-serialize-and-deserialize-binary-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0297-serialize-and-deserialize-binary-tree.ts)</div>}

classSolution {

funconvertBST(root:TreeNode?):TreeNode? {

var curSum=0

fundfs(node:TreeNode?) {

node?:return

dfs(node.right)

val temp= node.`val`

node.`val`+= curSum

curSum+= temp

dfs(node.left)

}

dfs(root)

return root

}

}