Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- # -*- coding: utf-8 -*-
- """
- Created on Tue Jun 28 14:25:43 2022
- @author: franc
- """
- class Node():
- def __init__(self, value):
- self.value = value
- self.left = None
- self.right = None
- def set_left(self, left_value):
- self.left = Node(left_value)
- return self
- def set_right(self, right_value):
- self.right = Node(right_value)
- return self
- class Arbol:
- def __init__(self, root):
- self.root = Node(root)
- def __value_chek(pointer, search_value):
- for side in [pointer.left, pointer.right]:
- if search_value == side.value:
- print('Encontrado')
- def search(self, search_value):
- if search_value == self.root.value:
- print('Encontrado')
- return
- else:
- pointer = self.root
- a = Arbol(0)
- a.root.set_left(1)
- a.root.set_right(2)
- a.root.left.set_left(3)
- a.root.left.set_right(4)
- print(a.root.value)
- print(a.root.left.value)
- print(a.root.left.left.value)
- print(a.root.left.right.value)
- print(a.root.right.value)
- a.search(3)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement