Binary Search Tree

Binary Search Tree

1. Tree

   • class structure
     • root
     • right subtree(>)
       • the left node is less than the node's value
     • left subtree(<)
       • the right node is greater than the node's value
   • functions
     • insert(pNumber)
       • if root == None, call Node() to creat a root, if not, call the root.insertElement(pNumber)
     • search(pNumber)
       • if root == None, return None or False, if not, call root. searchElement(pNumber)

2. Node

   • class structure
     • left node(<)
       • the left node is less than the node's value
     • value
     • right node(>)
       • the right node is greater than the node's value
   • functions
     • insertElement()
       • if pNumber greater then value number
         • and if node.right is not None, call node.right.insertElement
           • else if if node.right is None, call node.right = Node(pNumber)
       • if pNumber less than value number
         • and if node.left is not None, call node.left.insertElement
           • else if if node.left is None, call node.left = Node(pNumber)
     • searchElement()
       • if pNumber is node value, return true
         • else if pNumber > node.value and node.right != None, return return node.right.searchElement(pNumber)
           • else if pNumber > node.value and self.right is Nonem, then return False
             • else if pNumber < node.value and node.left != None, return return node.left.searchElement(pNumber)
               • else if pNumber < node.value and self.left is Nonem, then return False