Here is a method to create Binary Tree from numbers as they are feeded (which means without sorting first)
  
  
Root's Left Value: 5
Root's right Value: 15
Root's Left's Left Value: 3
Root's Left's right Value: 8
Root's Right's Left Value: 13
Root's Right's right Value: 17
class Node():
  def __init__(self, value, left=None, right=None):
    self.value = value
    self.left = left
    self.right = right
class BinaryTree():
  def __init__(self):
    self.root=Node(None)
  def add(self, value):
    self.curr=self.root
    self._add(value)
  def _add(self, value):
    if self.curr.value == None:
      self.curr.value = value
    else:
      if self.curr.value > value:
        if self.curr.left == None:
          self.curr.left = Node(value)
        else:
          self.curr = self.curr.left
          self._add(value)
      else:
        if self.curr.right == None:
          self.curr.right = Node(value)
        else:
          self.curr = self.curr.right
          self._add(value)
obj = BinaryTree()
obj.add(10)
obj.add(5)
obj.add(15)
obj.add(3)
obj.add(17)
obj.add(13)
obj.add(8)
obj.add(18)
obj.add(1)
obj.add(11)
obj.add(9)
obj.add(2)
obj.add(16)
obj.add(6)
obj.add(4)
obj.add(12)
obj.add(14)
obj.add(7)
obj.add(19)
obj.add(20)
obj.add(21)
print("Root Value: {}".format(obj.root.value))
print("Root's Left Value: {}".format(obj.root.left.value))
print("Root's right Value: {}".format(obj.root.right.value))
print("Root's Left's Left Value: {}".format(obj.root.left.left.value))
print("Root's Left's right Value: {}".format(obj.root.left.right.value))
print("Root's Right's Left Value: {}".format(obj.root.right.left.value))
print("Root's Right's right Value: {}".format(obj.root.right.right.value))
Output
Root Value: 10Root's Left Value: 5
Root's right Value: 15
Root's Left's Left Value: 3
Root's Left's right Value: 8
Root's Right's Left Value: 13
Root's Right's right Value: 17
Comments
Post a Comment