ezgibsahin / balanced-red-black-tree

Implementation of a modified red black tree named Balanced Red Black Tree in Java.

Balanced-Red-Black-Tree

Implementation of a modified red black tree named Balanced Red Black Tree in Java.

Rules

• Input Type:
  • V = Value of node.
  • K = Key of node.

• Balancing Conditions:
  • If root is not BLACK.
  • If two nodes in a row are RED.
  • If the difference of depth between any two subtrees is more than 1.\

• Balancing Transactions:
  • If root = RED then Recolor(root).
  • If node.uncle = RED then Recolor(node.parent, node.grandparent, node.uncle).
  • If node.uncle = BLACK and node_positions = TRIANGLE then Rotate(node.parent).
  • If node.uncle = BLACK and node_positions = LINE then Rotate(node.grandparent) and Recolor(node.parent, node.grandparent).
  • If the height of the left and right subtrees of each node is more than 1 then Rotate(node.grandgrandparent) and Recolor(node.grandparent, node.grandgrandparent).

Main Functionalities

• INSERT: Insert the given inputs to the tree.
• SEARCH: Search a user input (word) in the tree and return word, key, color, parent, grandparent, and uncle information of the node.