bst and hashes

Tree

BST and Hash Table

BST operation

binary and divide and conquer

• binary search : for sorted thing, become big problem to small problem by sorted algorithm
  • time complexity : O(log(n))
• divide and conquer :
  • big question to small question
  • samll solution become to big question solution
• example
  • isIdentical, isBalanceTree
  • last class: MaxHeight, path,
    

    BST and hash table realized by index

• searching a data in table need O(n) time
  

  Hash Table in JAVA

question