How will inorder, preorder and postorder traversals
print the elements of a tree?

• inorder-LOR
  preorder-OLR
  postorder-LRO
  
  L-left node
  O-root
  R-right node
• 10 years agoHelpfull: Yes(8) No(0)
• in order:LOR
  pre order:OLR
  post order:LRO
  L=LEFT CHILD
  R=RIGHT CHILD
  O=ROOT NODE
• 10 years agoHelpfull: Yes(0) No(0)
• preorder: root, left, right
  inorder: left, root, right
  postorder: left, right, root
• 10 years agoHelpfull: Yes(0) No(1)
• Inorder- visit left node(b)then root node(a) then right node (C) - bac
  Preorder-visit root node(a)then left node(b) then right node (C) - abc
  postorder-visit right node(c)then left node(b) then root node (a) - cba
• 9 years agoHelpfull: Yes(0) No(0)
• inorder-left data right
  preorder-data left right
  postorder-left right data
• 9 years agoHelpfull: Yes(0) No(0)
• inorder-Left Root Right
  preorder-Root Left Right
  postorder-Left Right Root
  
  
• 9 years agoHelpfull: Yes(0) No(0)
• in order: left child -root -right child
  pre order: root- left child - right child
  post order: left child - right child - root
• 9 years agoHelpfull: Yes(0) No(0)
• In inorder,left-root-right
  In preorder,root-left-right
  In postorder,left-right-root
• 9 years agoHelpfull: Yes(0) No(0)