Knowsh.com

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

http://www.knowsh.com

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

http://knowsh.com/Notes/NotesSearch/NotesDetail/140221/-Connectivity-Connected-Components-Tree-As-A-Graph-Directed-Graph-Representations-Directed-Acyclic-Graph-Indegree-And-Outdegree-Topological-Sort

 

Advertisements
Knowsh.com

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

http://www.knowsh.com

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.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140220/Trees-Binary-Tree-Binary-Search-Tree-Threaded-Binary-Tree-AVL-Trees-B-Tree-B-Plus-Tree-Decision-Trees-Game-Tree

 

Knowsh.com

Program to partition the linked list around a value

http://www.knowsh.com

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.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140215/Program-To-Partition-The-Linked-List-Around-A-Value