Euler Traversal & LCA in a Tree

Euler Traversal

  • Start as ROOT --> Subtree-1 --> ROOT --> Subtree-2 --> ROOT --> Subtree-3 --> ROOT
  • Recurse at each subtree as above
  • All nodes of a subtree appear together, contiguously in the traversal.

Why Euler Traversal Gets LCA?

enter image description here
Assume we want LCA of a node u in subtree a and node v in subtree c. A Euler walk of the tree will have all nodes of the subtree a followed by the LCA node ROOT and all the nodes of subtree c.

Thus Euler walk/ traversal of a tree will always have the LCA for any two nodes.


Written with StackEdit.


Bloom Filters

  • Used for determining presence of an element in a set.
  • Uses a set of hash functions that return an integer.
  • The returned value is used as index into a bit vector.
  • hash1(element) => index1
  • hash2(element) => index2
  • To search an element, we check for both the index are set. If yes, element might be there. Else say No.