Like this presentation? Why not share!

# Tree

## by Tri Atsumori, KP at Bank Nagari on Apr 22, 2012

• 833 views

Data Structure

Data Structure

### Views

Total Views
833
Views on SlideShare
833
Embed Views
0

Likes
0
21
0

No embeds

### Categories

Uploaded via SlideShare as Microsoft PowerPoint

## TreePresentation Transcript

• DATA STRUCTURE TREE 1109052 Jusahadi Silalahi 1109058 Kiagus Almuklis 1109064 Tri Reski
• Tree• Tree is one form of non-linear data structure that describes a hierarchical relationship (one to many relationship) between these elements.
• Cont’d
• BINARY TREE• binary tree is a tree data structure in which each node has at most two child node, usually distinguished as "left" and "right". Nodes with children are parents node, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child.
• Full Binary Tree
• Complete Binary Tree
• Skewed Binary Tree
• BINARY SEARCH TREE
• GRAPH• graph is an abstract data type that is meant to implement the graph and hypergraph concepts from mathematics
• HEAP SORT• Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family. Although somewhat slower in practice on most machines than a well implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtime. Heapsort is an in-place algorithm, but is not a stable sort.
• Cont’d
• HOW to Write TreeContoh Tree Sederhana Contoh Notasi Tingkat / Indentasi
• Cont’d Contoh Diagram VennNotasi Kurung(A(B(D)(E))(C(F)(G)))
• TRANSVERSAL TREE1. Pre Order• Go to root node• Left Subtree• Right Subtree
• Cont’d2. In Order• Left Subtree• Go to root node• Right Subtree
• Cont’d3. Post Order• Left Subtree• Right Subtree• Go to root node