How would you do this question in python?

(5) (50 pts) Given this skeleton a Node and a Red Black Tree class Node Node left; Node right; Node parent; int value; String color; Node (int value, String color); class RedBlackTree [ Node root; RedBlackTree(); void insert (int v); void remove (int v); Write the methods for insertion and deletion. These methods will require helper methods to handle the different cases for balancing the tree if the new insertion or deletion unbalances the tree. You will have to write code for these methods