Skip to main content

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

Next node of same level of tree

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

/* 
  Scala program for
  Find the next node of the key at the same 
  level in the binary tree
*/
// Binary Tree node
class TreeNode(var data: Int,
	var left: TreeNode,
		var right: TreeNode)
{
	def this(data: Int)
	{
		// Set node value
		this(data, null, null);
	}
}
class BinaryTree(var root: TreeNode,
	var status: Int,
		var result: TreeNode)
{
	def this()
	{
		this(null, -1, null);
	}
	// Method which are find next node of same level
	def findNextNode(temp: TreeNode, level: Int, node: Int): Unit = {
		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
			findNextNode(temp.left, level + 1, node);
			// Visit to right subtree
			findNextNode(temp.right, level + 1, node);
		}
	}
	// This are handling the request of to finding next
	// node in same level by given node
	def nextNode(node: Int): Unit = {
		// Reset the result indicator
		this.status = -1;
		this.result = null;
		// Find next node
		findNextNode(this.root, 0, node);
		println("\n Node : " + node);
		print(" Result : ");
		// Test Case
		if (status == -1)
		{
			// Case A
			// When node values are not exist
			println("Not found");
		}
		else if (this.result == null)
		{
			// Case B
			// When next node is not found
			println("None");
		}
		else
		{
			// Case C
			// When next node are exist
			println(this.result.data);
		}
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		// Create new tree
		var tree: BinaryTree = 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