Expression Tree and Disjoint Set

Data Structure, Tree, 이것이 자료구조+알고리즘이다 with C언어 (reference)

  • Use tree data structure
  • Expression Tree (수식 트리)
    • From postfix notation, we can make Expression Tree
    • Through various DFS (preOrder, inOrder, postOrder) on expression tree, it is easy to get prefix notation, infix notation, and postfix notation
  • Disjoint Set (분리 집합)
    • Through tree data structure, we can know which set certain elements are involved in

Pagination


© 2017. All rights reserved.

Powered by Hydejack v조현진