算法-红黑树的左旋右旋

1、左旋

 	private void leftRotate(RBTreeNode node) {
            RBTreeNode right = node.right;
            RBTreeNode parent = node.parent;
            if (parent == null) {
                root = right;
                right.parent = (null);
            } else {
                if (parent.left != null && parent.left == node) {
                    parent.left = (right);
                } else {
                    parent.right = (right);
                }
                right.parent = (parent);
            }
            node.parent = (right);
            node.right = (right.left);
            if (right.left != null) {
                right.left.parent = (node);
            }
            right.left = (node);
        }

2、右旋

 		private void rightRotate(RBTreeNode node) {
            RBTreeNode left = node.left;
            RBTreeNode parent = node.parent;
            if (parent == null) {
                root = left;
                left.parent = (null);
            } else {
                if (parent.left != null && parent.left == node) {
                    parent.left = (left);
                } else {
                    parent.right = (left);
                }
                left.parent = (parent);
            }
            node.parent = (left);
            node.left = (left.right);
            if (left.right != null) {
                left.right.parent = (node);
            }
            left.right = (node);
        }