Binary Search Next Biggest

class Node:
    """
    Tree node: left and right child + data which can be any object
    """
    def __init__(self, data, parent=None):
        """
        Node constructor

@param data node data object
        """
        self.left = None
        self.right = None
        self.data = data
        self.parent = parent
    
    def __str__(self):
		return str(self.data)
        
    def insert(self, data):
        if data < self.data:
            if self.left is None:
                self.left = Node(data, self)
            else:
                self.left.insert(data)
        elif data > self.data:
            if self.right is None:
                self.right = Node(data, self)
            else:
                self.right.insert(data)
                
    def lookup(self, data):
        if data < self.data:
            return self.left.lookup(data) if self.left is not None else None
        if data > self.data:
            return self.right.lookup(data) if self.right is not None else None
        return self
    
    def lowest(self):
        if self.left is None:
            return self
        return self.left.lowest()
    
    def next_highest(self, num):
        node = self.lookup(num)
        while node.data > node.parent.data:
            node = node.parent
        return node.parent
       
        
        
root = Node(8)
root.insert(3)
root.insert(10)
root.insert(1)
root.insert(6)
root.insert(4)
root.insert(7)
root.insert(14)
root.insert(13)

node = root.lookup(6)

print root.next_highest(7)
print root.next_highest(4)
print root.next_highest(1)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE