Implement a java method split a binary search Tree  with the value x

PYTHON programming Binary Search in Python In the Lecture, we implemented a binary search algorithm in Java where keys were the data values. Implement a similar program in Python.   Binary Search Tree Interfaceget(key) get the value key from treeset(key) insert value key into treesize() return number of non-empty nodesheight() return height of treerebalance()

Write in Java ****----------------------------------------------------------**** Given a Binary Search Tree (BST) and two keys in it. Implement the getDistance method to find the distance between two nodes with given keys, a and b. We assume that both keys exist in BST. A BST is a tree without duplicates. Distance between two nodes is the minimum number of edges to be traversed to reach one node from other   // find the distance between two nodes with given two keys, a and b int getDistance(int a, int b)   Sample Input 7 5 2 12 1 3 9 21 3 9                                                  5                                                 /  \                                             2      12                                            /  \      /  \                                          1     3   9   21 Sample Output  4 First line of the input is the BST elements Second line is the first key Third line is the secod key The distance from a = 3 to b = 9 in the above BST is 4.…

Write Java code to:  find the lowest common ancestor of two nodes n1, n2 in a linked binary tree structure. The lowest common ancestor is the lowest node in the tree thathas both n1 and n2 as descendants.