Q:
C# program to implement In-order traversal in Binary Tree
belongs to collection: C# Data Structure Solved Programs/Examples
C# Data Structure Solved Programs/Examples
- C# program to implement stack using array
- C# program to implement stack using structure
- C# program to implement Double Stack using structure
- C# program to implement Double Stack using class
- C# program to implement linear queue using array
- C# program to implement Linear Queue using structure
- C# program to implement circular queue using array
- C# program to push elements to stack using collection
- C# program to pop elements from stack using collection
- C# program to check whether element exists in stack or not
- C# program to copy stack elements to array
- C# program to insert or enqueue elements into queue using collection
- C# program to delete or dequeue elements from queue using collection
- C# program to clear all elements of Queue
- C# program to count total items/elements of Queue
- C# program to check element is exist in Queue or not
- C# program to copy Queue elements to array
- C# program to convert queue into object array
- C# program to peek elements from Queue using collection
- C# program to get all stack frames using StackTrace class
- C# program to implement Post-order traversal in Binary Tree
- C# program to implement Pre-order traversal in Binary Tree
- C# program to implement In-order traversal in Binary Tree
- C# program to traverse the singly linked list
- C# program to delete a given node from the singly Linked-List
- C# program to demonstrate the Tower Of Hanoi
- C# program to implement selection Sort
- C# program to implement selection Sort to arrange elements in the descending order
- C# program to sort an array in ascending order using insertion sort
- C# program to sort an array in descending order using insertion sort
- C# program to sort an array in ascending order using bubble sort
- C# program to sort an array in descending order using bubble sort
- C# program to sort an array using quick sort
- C# program to sort an array using merge sort
- C# program to sort an integer array using Radix Sort
- C# program to implement the Heap Sort
Program:
The source code to implement In-order traversal in Binary Tree is given below. The given program is compiled and executed successfully on Microsoft Visual Studio.
Output:
Explanation:
In the above program, we created three classes Node, BinaryTree, and Demo. The code class contains the item and left and a right pointer to the node.
The BinaryTree class is used to implement binary tree, it contains GetRoot(), InsertItem(), and Inorder_Traverse() methods.
The GetRoot() method returns the root node, and InsertItem() method is used to insert the item into the tree. The Inorder_Traverse() method is used to traverse the tree into in-order.
Now look to the Demo class, the Demo class contains the Main() method, here we created an object of BinaryTree class and then insert the items into the tree and then traverse them into in-order traversal.