Tree structure

• Basic keywords

Name	Exp
Root node	Node w/o parent
Leaf node	Node w/o child
Size	# of every node in tree
Depth	Distance from root
Height	Max depth
Degree	# of edges from parent to child

In this post, I will refer Left leaf(child) as L , Root as Root, Right leaf as R.

• Tree traversal
  • Pre-order: Root -> L -> R
  • In-order: L -> Root -> R
  • Post-order: R -> Root -> L

  ex)

• Binary Search Tree
  • Tree data structure for efficient binary search
  • Value: L < Root < R