Data Structures Notes
Monday, March 30, 2009
Prim-Jarnik's algorithm for extracting Minimum Spanning Tree (MST)
›
This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...
Kruskal's algorithm for extracting Minimum Spanning Tree (MST)
›
This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...
Spanning Tree & Minimum Spanning Tree (MST)
›
Spanning Tr ee - A tree that contains every vertex of a connected graph G is referred to as a spanning tree. The below figure depicts the Fi...
Friday, March 27, 2009
Application of a Binary Tree
›
The binary tree are applicable in the below mentioned fields: - Used in the compilers of high-level programming languages for intermediate r...
Exercise-Binary Tree Construction
›
Given data items: 17, 6, 3, 9 ,12, 15, 1, 18, 22 The resulting binary tree is:
What is a Binary Tree?
›
A binary tree embodies a finite set of data items that is either empty or partitioned into three disjoint subsets. The first part contains a...
2 comments:
What is a Complete Binary Tree?
›
A strictly binary tree of depth 'd' in which all the leaves are at level 'd' i.e. there is non empty left or right subtrees ...
1 comment:
›
Home
View web version