liuchenjane的博客

450. Delete Node in a BSTGiven 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

应用mergeSort的思想，可以解决许多和下标有关的问题。看了有关题的提示，发现有些能用Divide and Conqure解决的，也可以用 Binary Search Tree，Segment Tree，Binary Index Tree解决。它们都可以把原始的时间复杂度为O(n2)O(n^2)的算法降低为O(nlogn)O(nlogn). 下面从求数组的逆序数对这一问题，用不同的方法去解决。

Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled, and

BST包含的功能：插入，删除，查找，查找某一结点的后续和前驱，中序遍历和前序遍历这里，用于实验的二叉树://二叉搜索树BST#include #include using namespace std;class TreeNode{ public: int key; TreeNode* left; TreeNode* right; TreeNode* p;//

AVL tree (Adelson-Velskii-Landis tree)一颗AVL树是其每个节点的左子树和右子树的高度最多差1的二叉查找树。加了额外的平衡条件是为了确保整棵树的深度为O(logN)在高度为h的AVL树，最少节点数S(h)=S(h-1)+S(h-2)+1.=========================================================