Connectivity, Connected Components, Sub Graph, Tree as a Graph, Directed Graph, Representations, Directed Acyclic Graph, Indegree and Outdegree, Topological Sort.

Skip to content
# Month: September 2016

# Connectivity, Connected Components, Sub Graph, Tree as a Graph, Directed Graph, Representations, Directed Acyclic Graph, Indegree and Outdegree, Topological Sort

# Trees, Binary Tree, Binary Search Tree, Threaded Binary Tree, AVL Trees, B-tree, B plus Tree, Decision Trees, Game Tree

# Program to Implementation of Queue using two Stacks

# Program to implement a single stack using multiple stacks

# Program to show the implementation of three stacks in a single array

# Program to check if linked list is a Palindrome or not

# Program to partition the linked list around a value

# Program to Compress the String

# Program to check if the two strings are one characters away

Connectivity, Connected Components, Sub Graph, Tree as a Graph, Directed Graph, Representations, Directed Acyclic Graph, Indegree and Outdegree, Topological Sort.

Advertisements

Trees, Leaves, Non-Terminal Nodes, Length, Depth/Height of any node, Height of tree, Forest, Ordered Trees, Complete trees, Binary Tree, Strictly Binary Tree, Complete Binary Tree, Implementation using Linked List, Binary Search Tree, Operations on Binary Search Tree, Inorder, preorder, postorder traversal, Threaded Binary Tree, AVL Trees, B-tree, B+ Tree, B* Tree, Tree Applications, Decision Trees, Game Tree.

Queue via Stacks: Implement a Queue Class which implements a queue using two Stacks.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140219/Program-To-Implement-Queu-Using-Two-Stacks

Stack of Plates: Imagine a (literal) stack of plates. It the stack gets too high, it might topple. Therefore, in real life, we would likely to start new stack when the previous stack exceeds some threshold. Implement a data structure that mimics this.

Write a program to show the implementation of three stacks in a single array. Methods to be implemented are Push(), Pop() and Peek().

Implement a function to check if a linked list is a Palindrome or not. Asked in Microsoft interview. Compiler used C#.

Partition a linked list around a value x, such that all nodes more than x come before all the nodes less than or equal to x. If x is contained within the list, the value of x only need to be after the elements more than x. Compiler used: C#. Asked in Microsoft interview.

Implement a method to perform basic string compression using the counts of repeated characters. If the “compressed” string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a – z).

http://knowsh.com/Notes/NotesSearch/NotesDetail/140214/Program-To-Compress-The-String

There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.