Complete each of the following in python?

Programmatically implement a tree that includes the following:

a$.$ A node that has $4$ properties:

i$.$ value

ii$.$ parent

iii. leftChild

iv$.$ rightChild

b$.$ Pointer or variable that indicates the root of the tree

Create three methods that print out the values of the tree using an inorder, preorder

and postorder tree walk.

Write$-$up pseudocode for a method that runs in linear time that determines if a tree is a

binary search tree. This method must have a base case. After the pseudocode has been

developed, implement it using one of the approved languages.

Create a method that returns the successor given a binary search tree and a node value

$($you may assume all values in the BST are unique$).$