Skip to main content

Detect next node at same level of a key in binary tree in c#

Next node of same level of tree

Csharp program for Detect next node at same level of a key in binary tree. Here mentioned other language solution.

// Include namespace system
using System;
/* 
  Csharp program for
  Find the next node of the key at the same 
  level in the binary tree
*/
// Binary Tree node
public class TreeNode
{
	public int data;
	public TreeNode left;
	public TreeNode right;
	public TreeNode(int data)
	{
		// Set node value
		this.data = data;
		this.left = null;
		this.right = null;
	}
}
public class BinaryTree
{
	public TreeNode root;
	public int status;
	public TreeNode result;
	public BinaryTree()
	{
		// Set initial values
		this.root = null;
		this.status = -1;
		this.result = null;
	}
	// Method which are find next node of same level
	public void findNextNode(TreeNode temp, 
                              int level, 
                              int node)
	{
		if (temp != null)
		{
			if (this.status == -1 && temp.data == node)
			{
				// When found node value
				this.status = level;
			}
			else if (this.status == level && this.result == null)
			{
				// Next node of same level
				this.result = temp;
			}
			// Visit to left subtree
			this.findNextNode(temp.left, level + 1, node);
			// Visit to right subtree
			this.findNextNode(temp.right, level + 1, node);
		}
	}
	// This are handling the request of to finding next
	// node in same level by given node
	public void nextNode(int node)
	{
		// Reset the result indicator
		this.status = -1;
		this.result = null;
		// Find next node
		this.findNextNode(this.root, 0, node);
		Console.WriteLine("\n Node : " + node);
		Console.Write(" Result : ");
		// Test Case
		if (this.status == -1)
		{
			// Case A
			// When node values are not exist
			Console.WriteLine("Not found");
		}
		else if (this.result == null)
		{
			// Case B
			// When next node is not found
			Console.WriteLine("None");
		}
		else
		{
			// Case C
			// When next node are exist
			Console.WriteLine(this.result.data);
		}
	}
	public static void Main(String[] args)
	{
		// Create new tree
		var tree = new BinaryTree();
		/*
		   Make A Binary Tree
		  ---------------------
		        1
		       / \ 
		      /   \ 
		     /     \
		    2       4
		   /       / \
		  /       /   \
		  3      6     5
		   \      \   /
		    7      8 11
		              
		*/
		// Add node in Binary Tree
		tree.root = new TreeNode(1);
		tree.root.left = new TreeNode(2);
		tree.root.left.left = new TreeNode(3);
		tree.root.left.left.right = new TreeNode(7);
		tree.root.right = new TreeNode(4);
		tree.root.right.right = new TreeNode(5);
		tree.root.right.right.left = new TreeNode(11);
		tree.root.right.left = new TreeNode(6);
		tree.root.right.left.right = new TreeNode(8);
		// Testing
		tree.nextNode(3);
		tree.nextNode(7);
		tree.nextNode(6);
		tree.nextNode(5);
		tree.nextNode(8);
		tree.nextNode(1);
	}
}

Output

 Node : 3
 Result : 6

 Node : 7
 Result : 8

 Node : 6
 Result : 5

 Node : 5
 Result : None

 Node : 8
 Result : 11

 Node : 1
 Result : None




Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment