Hi, I would like to contribute codes about :
AVL -> An AVL tree is a self-balancing Binary Search Tree (BST). In an AVL tree, the heights of the two child sub-trees of any node differ by at most one, ensuring the tree remains balanced.
Red black tree -> A Red-Black Tree is another self-balancing BST where each node contains an extra bit for colour (either red or black). The tree is balanced by following a set of properties, ensuring that the longest path from the root to a leaf is no more than twice as long as the shortest path.
Segment tree -> A Segment Tree is used for storing intervals or segments. It allows answering range queries like sum or minimum value in a sub-array efficiently and supports point updates.
Please assign me this and add Hactoberfest tag.
Hi, I would like to contribute codes about :
AVL -> An AVL tree is a self-balancing Binary Search Tree (BST). In an AVL tree, the heights of the two child sub-trees of any node differ by at most one, ensuring the tree remains balanced.
Red black tree -> A Red-Black Tree is another self-balancing BST where each node contains an extra bit for colour (either red or black). The tree is balanced by following a set of properties, ensuring that the longest path from the root to a leaf is no more than twice as long as the shortest path.
Segment tree -> A Segment Tree is used for storing intervals or segments. It allows answering range queries like sum or minimum value in a sub-array efficiently and supports point updates.
Please assign me this and add Hactoberfest tag.