implement stack using linked list in typescript

Ts program for implement stack using linked list. Here problem description and explanation.

// TypeScript program for
// Implementation stack using linked list

// Stack Node
class StackNode
{
	public data: number;
	public next: StackNode;
	constructor(data: number, top: StackNode)
	{
		this.data = data;
		this.next = top;
	}
}
class MyStack
{
	public top: StackNode;
	public count: number;
	constructor()
	{
		this.top = null;
		this.count = 0;
	}
	// Returns the number of element in stack
	public number size()
	{
		return this.count;
	}
	public boolean isEmpty()
	{
		if (this.size() > 0)
		{
			return false;
		}
		else
		{
			return true;
		}
	}
	// Add a new element in stack
	public push(data: number)
	{
		// Make a new stack node
		// And set as top
		this.top = new StackNode(data, this.top);
		// Increase node value
		this.count++;
	}
	// Add a top element in stack
	public number pop()
	{
		var temp = 0;
		if (this.isEmpty() == false)
		{
			// Get remove top value
			temp = this.top.data;
			this.top = this.top.next;
			// Reduce size
			this.count--;
		}
		return temp;
	}
	// Used to get top element of stack
	public number peek()
	{
		if (!this.isEmpty())
		{
			return this.top.data;
		}
		else
		{
			return 0;
		}
	}
}
class Test
{
	public static main()
	{
		// Create new stack 
		var s = new MyStack();
		console.log("\n Is empty : " + s.isEmpty());
		// Add element
		s.push(15);
		s.push(14);
		s.push(31);
		s.push(21);
		s.push(10);
		console.log("\n Top  : " + s.peek());
		console.log(" Size : " + s.size());
		console.log("\n Is empty : " + s.isEmpty());
		// Delete Stack Element
		var data = s.pop();
		console.log("\n Pop element " + data);
		console.log(" Size : " + s.size());
		data = s.pop();
		console.log("\n Pop element " + data);
		console.log(" Size : " + s.size());
	}
}
Test.main();
/*
 file : code.ts
 tsc --target es6 code.ts
 node code.js
 */

Output

 Is empty : true

 Top  : 10
 Size : 5

 Is empty : false

 Pop element 10
 Size : 4

 Pop element 21
 Size : 3


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







© 2021, kalkicode.com, All rights reserved