JavaAlgorithms/DataStructures/Trees/RedBlackBST.java at main · sarvex/JavaAlgorithms · GitHub

History

331 lines (305 loc) · 7.64 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

package DataStructures.Trees;

import java.util.Scanner;

/** @author jack870131 */

public class RedBlackBST {

private final int R = 0;

private final int B = 1;

private class Node {

int key = -1, color = B;

Node left = nil, right = nil, p = nil;

Node(int key) {

this.key = key;

}

private final Node nil = new Node(-1);

private Node root = nil;

public void printTree(Node node) {

if (node == nil) {

return;

}

printTree(node.left);

System.out.print(

((node.color == R) ? " R " : " B ") + "Key: " + node.key + " Parent: " + node.p.key + "\n");

printTree(node.right);

}

public void printTreepre(Node node) {

if (node == nil) {

return;

}

System.out.print(

((node.color == R) ? " R " : " B ") + "Key: " + node.key + " Parent: " + node.p.key + "\n");

printTree(node.left);

printTree(node.right);

}

private Node findNode(Node findNode, Node node) {

if (root == nil) {

return null;

}

if (findNode.key < node.key) {

if (node.left != nil) {

return findNode(findNode, node.left);

}

} else if (findNode.key > node.key) {

if (node.right != nil) {

return findNode(findNode, node.right);

}

} else if (findNode.key == node.key) {

return node;

}

return null;

}

private void insert(Node node) {

Node temp = root;

if (root == nil) {

root = node;

node.color = B;

node.p = nil;

} else {

node.color = R;

while (true) {

if (node.key < temp.key) {

if (temp.left == nil) {

temp.left = node;

node.p = temp;

break;

} else {

temp = temp.left;

}

} else if (node.key >= temp.key) {

if (temp.right == nil) {

temp.right = node;

node.p = temp;

break;

} else {

temp = temp.right;

}

fixTree(node);

}

private void fixTree(Node node) {

while (node.p.color == R) {

Node y = nil;

if (node.p == node.p.p.left) {

y = node.p.p.right;

if (y != nil && y.color == R) {

node.p.color = B;

y.color = B;

node.p.p.color = R;

node = node.p.p;

continue;

}

if (node == node.p.right) {

node = node.p;

rotateLeft(node);

}

node.p.color = B;

node.p.p.color = R;

rotateRight(node.p.p);

} else {

y = node.p.p.left;

if (y != nil && y.color == R) {

node.p.color = B;

y.color = B;

node.p.p.color = R;

node = node.p.p;

continue;

}

if (node == node.p.left) {

node = node.p;

rotateRight(node);

}

node.p.color = B;

node.p.p.color = R;

rotateLeft(node.p.p);

}

root.color = B;

}

void rotateLeft(Node node) {

if (node.p != nil) {

if (node == node.p.left) {

node.p.left = node.right;

} else {

node.p.right = node.right;

}

node.right.p = node.p;

node.p = node.right;

if (node.right.left != nil) {

node.right.left.p = node;

}

node.right = node.right.left;

node.p.left = node;

} else {

Node right = root.right;

root.right = right.left;

right.left.p = root;

root.p = right;

right.left = root;

right.p = nil;

root = right;

}

void rotateRight(Node node) {

if (node.p != nil) {

if (node == node.p.left) {

node.p.left = node.left;

} else {

node.p.right = node.left;

}

node.left.p = node.p;

node.p = node.left;

if (node.left.right != nil) {

node.left.right.p = node;

}

node.left = node.left.right;

node.p.right = node;

} else {

Node left = root.left;

root.left = root.left.right;

left.right.p = root;

root.p = left;

left.right = root;

left.p = nil;

root = left;

}

void transplant(Node target, Node with) {

if (target.p == nil) {

root = with;

} else if (target == target.p.left) {

target.p.left = with;

} else target.p.right = with;

with.p = target.p;

}

Node treeMinimum(Node subTreeRoot) {

while (subTreeRoot.left != nil) {

subTreeRoot = subTreeRoot.left;

}

return subTreeRoot;

}

boolean delete(Node z) {

if ((z = findNode(z, root)) == null) return false;

Node x;

Node y = z;

int yorigcolor = y.color;

if (z.left == nil) {

x = z.right;

transplant(z, z.right);

} else if (z.right == nil) {

x = z.left;

transplant(z, z.left);

} else {

y = treeMinimum(z.right);

yorigcolor = y.color;

x = y.right;

if (y.p == z) x.p = y;

else {

transplant(y, y.right);

y.right = z.right;

y.right.p = y;

}

transplant(z, y);

y.left = z.left;

y.left.p = y;

y.color = z.color;

}

if (yorigcolor == B) deleteFixup(x);

return true;

}

void deleteFixup(Node x) {

while (x != root && x.color == B) {

if (x == x.p.left) {

Node w = x.p.right;

if (w.color == R) {

w.color = B;

x.p.color = R;

rotateLeft(x.p);

w = x.p.right;

}

if (w.left.color == B && w.right.color == B) {

w.color = R;

x = x.p;

continue;

} else if (w.right.color == B) {

w.left.color = B;

w.color = R;

rotateRight(w);

w = x.p.right;

}

if (w.right.color == R) {

w.color = x.p.color;

x.p.color = B;

w.right.color = B;

rotateLeft(x.p);

x = root;

}

} else {

Node w = x.p.left;

if (w.color == R) {

w.color = B;

x.p.color = R;

rotateRight(x.p);

w = x.p.left;

}

if (w.right.color == B && w.left.color == B) {

w.color = R;

x = x.p;

continue;

} else if (w.left.color == B) {

w.right.color = B;

w.color = R;

rotateLeft(w);

w = x.p.left;

}

if (w.left.color == R) {

w.color = x.p.color;

x.p.color = B;

w.left.color = B;

rotateRight(x.p);

x = root;

}

x.color = B;

}

public void insertDemo() {

Scanner scan = new Scanner(System.in);

while (true) {

System.out.println("Add items");

int item;

Node node;

item = scan.nextInt();

while (item != -999) {

node = new Node(item);

insert(node);

item = scan.nextInt();

}

printTree(root);

System.out.println("Pre order");

printTreepre(root);

break;

}

scan.close();

}

public void deleteDemo() {

Scanner scan = new Scanner(System.in);

System.out.println("Delete items");

int item;

Node node;

item = scan.nextInt();

node = new Node(item);

System.out.print("Deleting item " + item);

if (delete(node)) {

System.out.print(": deleted!");

} else {

System.out.print(": does not exist!");

}

System.out.println();

printTree(root);

System.out.println("Pre order");

printTreepre(root);

scan.close();

}

JavaAlgorithms/DataStructures/Trees/RedBlackBST.java at main · sarvex/JavaAlgorithms · GitHub

Expand file tree

Breadcrumbs

RedBlackBST.java

Latest commit

History

Breadcrumbs

RedBlackBST.java

File metadata and controls