Pre, post and in-order traversal of a binary search tree

using System;

using System.Collections.Generic;

using System.Collections;

using System.Linq;

using System.Text;

 

namespace ConsoleApplication1

{

    public class Node

    {

        private Node left;

        private Node right;

        private int value;

        public Node(Node left, Node right, int value)

        {

            this.left = left;

            this.right = right;

            this.value = value;

        }

        public Node getLeft()

        {

            return left;

        }

        public Node getRight()

        {

            return right;

        }

        public int getValue()

        {

            return value;

        }

    }

 

    class Program

    {

        static void Main(string[] args)

        {

            //Initializing the tree structure

            Node bottomFirst = new Node(null, null, 1);

            Node bottomSecond = new Node(null, null, 4);

            Node bottomThird = new Node(null, null, 7);

            Node bottomFourth = new Node(null, null, 12);

            Node middleFirst = new Node(bottomFirst, bottomSecond, 3);

            Node middleSecond = new Node(bottomThird, bottomFourth, 10);

            Node root = new Node(middleFirst, middleSecond, 5);

            Console.WriteLine("PreOrderTraversal");

            PreOrderTraversal(root);

            Console.WriteLine();

            Console.WriteLine("InOrderTraversal");

            InOrderTraversal(root);

            Console.WriteLine();

            Console.WriteLine("PostOrderTraversal");

            PostOrderTraversal(root);

            Console.WriteLine();

        }

        public static void PreOrderTraversal(Node root)

        {

            if (root == null)

            {

                return;

            }

            Console.Write(root.getValue() + " ");

            PreOrderTraversal(root.getLeft());

            PreOrderTraversal(root.getRight());

        }

        public static void InOrderTraversal(Node root)

        {

            if (root == null)

            {

                return;

            }

            InOrderTraversal(root.getLeft());

            Console.Write(root.getValue() + " ");

            InOrderTraversal(root.getRight());

        }

        public static void PostOrderTraversal(Node root)

        {

            if (root == null)

            {

                return;

            }

            PostOrderTraversal(root.getLeft());

            PostOrderTraversal(root.getRight());

            Console.Write(root.getValue() + " ");

        }

    }

}
 
PreOrderTraversal
5 3 1 4 10 7 12
InOrderTraversal
1 3 4 5 7 10 12
PostOrderTraversal
1 4 3 7 12 10 5
Press any key to continue . . .
Advertisements
This entry was posted in Information Technology. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s