[LeetCode] 285. Inorder Successor in BST 二叉搜索樹中的中序后繼節點
Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node ...
原文：[LeetCode] 450. Delete Node in a BST 刪除二叉搜索樹中的節點
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference possibly updated of the BST. Basically, the deletion can be divided into ...
2016-12-28 09:33 9 13332 推薦指數：
相關推薦
[LeetCode] 510. Inorder Successor in BST II 二叉搜索樹中的中序后繼節點之二
Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node ...
[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 ...
[LeetCode] 230. Kth Smallest Element in a BST 二叉搜索樹中的第K小的元素
≤ BST's total elements. Example 1: Example 2: ...
[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. ...
二叉搜索樹（BST）詳解
前言：平衡樹的前置知識吧 二叉搜索樹的定義： 二叉搜索樹或者是一棵空樹，或者是具有下列性質的二叉樹： （1）若左子樹不空，則左子樹上所有結點的值均小於或等於它的根節點的值； （2）若右子樹不空，則右子樹上所有結點的值均大於或等於它的根結點的值； （3）左、右子樹也分別為二叉搜索樹 ...
二叉搜索樹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 ...