Consider the following binary tree shown below. List the nodes of this binary tree in an in-Order sequence. List the nodes of this binary tree in a Pre-order sequence. List the nodes of this binary tree in a Post-order sequence. Solution Pre order- A B C D E F G order is( center - left - right) In order - D C B E A F G order is (left - center - right ) Post - order : D C E B G F A order is (left - right - center ).