Saturday, February 23, 2019

Red black tree(Introduction)

Vikas Tomar's DEV Profile

Red black tree (Introduction)

Red black tree is special type of binary search tree. It is self balancing binary search tree like as (AVL tree).
Some properties must be follow for red black tree.
  • Every node has a color either Black and red.
  • Root node always a black.
  • Every leaf  which nil (null) is black.
  • If node is red then both children must be black or if node is red, then its parent must be black.
  • for n node, all path form the to descendant leaves contain the same number of black node


NOTE ⇉  Whenever root is red node then we remove node by black node.


Arrays in Solidity Programming Language.

Arrays Solidity supports both generic and byte arrays. It supports both fixed size and dynamic arrays. It also supports multidimensional ...