Facebook
From Melisa Rebeca, 1 Week ago, written in Python.
Embed
Download Paste or View Raw
Hits: 94
  1. rootPointer = -1
  2. class Node():
  3.     def __init__(self, leftPointerP=-1, itemP=0, rightPointerP=-1):
  4.         self.item = itemP
  5.         self.leftPointer = leftPointerP
  6.         self.rightPointer = rightPointerP
  7. BinaryTree = [ Node() for i in range(10)]
  8. for i in range(10):
  9.     print(BinaryTree[i].item)
  10. def find(itemSearched):
  11.     currentPointer = rootPointer
  12.     while(currentPointer != -1):
  13.         if itemSearched < BinaryTree[currentPointer].item:
  14.             currentPointer = BinaryTree[currentPointer].leftPointer
  15.         elif itemSearched > BinaryTree[currentPointer].item:
  16.             currentPointer = BinaryTree[currentPointer].rightPointer
  17.         elif itemSearched == BinaryTree[currentPointer].item:
  18.             return currentPointer, True
  19.     return -1, False
  20. print(find(7))
  21.