[LeetCode] Minimum Distance Between BST Nodes 二叉搜索樹中結點的最小距離
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. ...
原文：[LeetCode] Minimum Absolute Difference in BST 二叉搜索樹的最小絕對差
Given a binary search tree with non negative values, find the minimumabsolute differencebetween values of any two nodes. Example: Note:There are at least two nodes in this BST. 這道題給了我們一棵二叉搜索樹，讓我們求任意個 ...
2017-03-12 23:17 2 6537 推薦指數：
相關推薦
[LeetCode] Split BST 分割二叉搜索樹
Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes ...
二叉搜索樹（BST）詳解
； 如圖（一顆長殘了的BST）： 二叉搜索樹的查詢： 若根結點的關鍵字值等於查找的關鍵字，返回 ...
二叉搜索樹BST
二叉查找樹（Binary Search Tree），（又：二叉搜索樹，二叉排序樹）它可以是一棵空樹，也可以是具有下列性質的二叉樹： 若它的左子樹不空，則左子樹上所有結點的值均小於它的根結點的值； 若它的右子樹不空，則右子樹上所有結點的值均大於它的根結點的值； 它的左、右子樹也分別為二叉排序樹。二叉 ...
[LeetCode] Convert BST to Greater Tree 將二叉搜索樹BST轉為較大樹
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum ...
[LeetCode] 1200. Minimum Absolute Difference 最小絕對差
Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list ...
[LeetCode] 938. Range Sum of BST 二叉搜索樹的區間和
Given the `root` node of a binary search tree, return the sum of values of all nodes with value bet ...
[LeetCode] Serialize and Deserialize BST 二叉搜索樹的序列化和去序列化
Serialization is the process of converting a data structure or object into a sequence of bits so ...