Binary search tree is the updated form of binary tree in which left node have less value and right node have higher value
Read More →AVL tree is the binary tree at which each node have balancing factor of -1,0,1
Read More →Complete binary tree is the updated form of binary tree
Read More →Full binary tree is the tree in which each node have exactly 2 sub-child
Read More →A spanning tree with minimum weight is called minimum spanning tree
Read More →