Data

Attribution Non-Commercial (BY-NC)

4 views

Data

Attribution Non-Commercial (BY-NC)

- Aptitude
- Data Structures Using ‘c’ Language
- AVL-Tree-Operation.pdf
- AVL trees
- DataStructure GATE
- Answer All the Questions
- Tree
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
- Data Structure
- 10.1.1.98
- 03 Data Structures
- 06_3
- Thies Dna06
- CS2251-QB
- Enhancement
- Assignment4--BinaryTrees
- Data Structure With C July 2013
- art2
- Interview Experiences and Tips
- CSC148_TT1_2014W

You are on page 1of 24

Trees

Hierarchical data structure Each position in the tree is called a node The top of the tree is called the root The nodes immediately below a node are called its children; nodes with no children are called leaves (or terminal nodes), or terminal nodes, and the node above a given node is its parent (or father) A node x is ancestor of node y if x is father of y or father of some ancestor of y. y is called descendent of x. Ancestor of a node is its parent, grand parent or grand-grand parent or so on.

Nodes with the same parent are siblings A node plus the collection of nodes beneath it is called a subtree The number of nodes in the longest path from the root to a leaf is the depth (or height) of the tree

is the depth 2 or 3? depends on the author

Node H

Node I

Node J

Node K Node L

Nodes H and I are siblings C is Hs parent, H and I are children of C What is the depth of this tree?

Binary Trees

A commonly used type of tree is a binary tree Each node has at most two children The tree is a conceptual structure The data can be stored either in a dynamic linked tree structure, or in contiguous memory cells (array) according to a set pattern; in other words, implementation can be pointer-based or array-based

Binary trees

A tree is called strictly binary tree if every non leaf node has exactly two children. A strictly binary tree having n leaves always contain 2n-1 nodes Text book definition of depth of a tree

Depth of binary tree is maximum level of any leaf in the tree. Root of tree is at level 0, and level of any other node in the tree is one more than the level of its father

Binary Trees

A complete binary tree of level d is the strictly binary tree all of whose leaves are at level d A complete binary tree of level d has 2l nodes at each level l where 0<=l<=d Total number of nodes (tn) in a complete binary tree of depth d will be:

tn 2 2 2 2 2 j 2 d 1 1

0 1 2 d j 0 d

Binary Trees

For a complete binary tree if number of nodes (tn) are known, then we may find depth of the binary tree

tn 2 2

d 1

d 1

tn 1

A binary tree with nodes n has height O(log2n)

Linked List based implementation Array based implementation

Each node in the tree consists of:

The data, or value contained in the element A left child pointer (pointer to first child) A right child pointer (pointer to second child)

A root pointer points to the root node

Follow pointers to find every other element in the tree

Add and remove nodes by manipulating pointers Leaf nodes have child pointers set to null

class CBinTree { struct Node { int value; Node *LeftChild,*RightChild; }*Root; /***Operations*********/ /************************/ };

ROOT

Value in root node stored first, followed by left child, then right child Each successive level in the tree stored left to right; unused nodes in tree represented by a bit pattern to indicate nothing stored there Children of any given node n is stored in cells 2n and 2n + 1 (If array index starts at 1) Can calculate position for any given node Storage allocated as for full tree, even if many nodes empty For a tree of depth h we need array of 2h+1-1 cells

Binary Trees

Full binary tree of height (depth) h: all nodes at a height less than h have exactly two children Balanced binary tree: for each node, the difference in depth of the right and left subtrees is no more than one Completely balanced tree: left and right subtrees of every node have the same height

Primitive Operations

Left(node): Gives index/pointer of left child Right(node): Gives index/pointer of right child Parent(node): Returns index/pointer of parent Brother(node): Returns index/pointer of brother Root: Gives index/pointer of root node Info(Node): Data/Info stored at node IsLeft(node): Is node left child? Yes/No IsRight(node): Is node right child? Yes/No

Common Operations

Tree traversal Node addition Node deletion Destroy

Pass through all nodes of tree Inorder (symmetric traversal) Preorder (depth first traversal) Postorder

Trees Traversal

Inorder

(Left) Root (Right)

Root

Preorder

Root (Left) (Right)

Left

Right

Postorder

(Left) (Right) Root

Inorder Traversal

Left Root Right manner

* + +

(A*B)+(C*D+E)

Preorder Traversal

Root Left Right manner + Left Right + [*Left Right] [+Left Right] +(*AB) [+ *Left Right E] +*AB + *C D E

+ * +

Postorder Traversal

Left Right Root manner

* + +

Left Right + [Left Right *] [Left Right+] + (AB*) [Left Right * E + ]+ (AB*) [C D * E + ]+ AB* C D * E + +

Elements are sorted: For any node n in a binary search tree:

The value at n is greater than the values of any of the nodes in its left subtree The value at n is less than the values of any of the nodes in its right subtree Its left and right subtrees are binary search trees

Need to define greater than and less than for the specific data

- AptitudeUploaded byFAZULUL RAHMAN
- Data Structures Using ‘c’ LanguageUploaded bySaurabh Kumar
- AVL-Tree-Operation.pdfUploaded byRajContent
- AVL treesUploaded byapi-19981779
- DataStructure GATEUploaded byuanuli
- Answer All the QuestionsUploaded bypitchrks19841
- TreeUploaded byrajashreetillu
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relationUploaded bylacnort
- Data StructureUploaded byPriyanka Sinha
- 10.1.1.98Uploaded byKumar Ramasamy
- 03 Data StructuresUploaded byAditya Singh
- 06_3Uploaded byFarah Nassib
- Thies Dna06Uploaded byarnitha_akhila
- CS2251-QBUploaded bysivamspecial555
- EnhancementUploaded byJoy Chakravorty
- Assignment4--BinaryTreesUploaded byPrachi Dabaria
- Data Structure With C July 2013Uploaded byPrasad C M
- art2Uploaded byDiego Rueda
- Interview Experiences and TipsUploaded bySumanth S Murthy
- CSC148_TT1_2014WUploaded byexamkiller
- Huet ZipperUploaded byVivekNarayanan
- asg1Uploaded byPrem Nidhi
- les19Uploaded byAbdul Ghaffar
- FCS 04 Trees Part01Uploaded byAnand Biradar
- Revision QuestionsUploaded byJai Gaizin
- Les07.pptUploaded byMac Millan
- Upload ScribdUploaded byjainvidisha
- 07-treesUploaded byBuck Dancer
- CS-GATE-2019-shift-3-MEASY.pdfUploaded byshubham
- CS8381-DSlabmanUploaded bydhanalakshmanan 2001

- SequStratCatuneanu02.pptUploaded bycatarac19
- Contour LinesUploaded byAkshay D Nicator
- Earthquake SizeUploaded bycatarac19
- Global Basin Classification-Kingston,Dishroon,WiiliamsUploaded byEugene Théõpháñy Ôthñîél Ûróró
- ISSC Report on Sequence StratigraphyUploaded byTouseef Rehman
- EustasyGuidishLercheKendallOBrian84.pdfUploaded bycatarac19
- Channel sandstones.pdfUploaded bycatarac19
- BasinEvaluationBurial.pdfUploaded bycatarac19
- Ancient Example of Beach SandstoneUploaded bycatarac19
- EaES455-6.pptUploaded bycatarac19
- EaES455-4.pptUploaded bycatarac19
- EaES455-7.pptUploaded bycatarac19
- EaES455-12.pptUploaded bycatarac19
- EaES455txt.pptUploaded bycatarac19
- The geology of stratigraphic sequences.pdfUploaded bycatarac19
- Basin & Ranges.pptUploaded bycatarac19
- L03_utilities_for-edit-of-input (5 days).pptUploaded bycatarac19
- L05_FaultModeling (5 days).pptUploaded bycatarac19
- l09_zonation (5 days).pptUploaded bycatarac19
- L10_Layering (5 Days)Uploaded bycatarac19
- L12_Log-Upscaling (5 Days)Uploaded bycatarac19
- L19_workflow (5 days).pptUploaded bycatarac19
- l11_geometrical modeling (5 days).pptUploaded bycatarac19
- Lat-Long-To-XY-(WAA)Uploaded bycatarac19
- WGS_Stratigraphic Trap Classification.pdfUploaded bycatarac19
- Stratigraphy and Sedimentary Rocks.pdfUploaded bycatarac19
- Traps.docUploaded bycatarac19

- 1026 Int Diploma IA7 v2Uploaded byfarhat ali
- OPR320 SyllabusUploaded bymoney1000000
- Supplier Interface in Oracle Apps R12Uploaded byRavi Varma
- Cookery ModuleUploaded byJordanPuhawan
- menieres-2012-00529Uploaded bySocky112
- Cyber BullyUploaded byAmirah Hanani
- KnapsackUploaded byPríyöjìt Däs
- ECAM- Group 3.pdfUploaded byHaroonNasir
- TO SEE THE PATTERN OF INTERNAL ORGAN INJURIES ASSOCIATED TO ABDOMINAL TRAUMAUploaded byBaru Chandrasekhar Rao
- TQM in HospitalUploaded byAhmed Ali
- NHS Manchester Application Development Policy v1.2Uploaded bymrn_bd
- ME_PAPER_2sdadfasfUploaded byRanga Sri
- Shade HouseUploaded byRyan Harrington
- Rafhan Maize Project of Financial Statement AnalysisUploaded byzonash ghaffar
- Rupert Maclean - UNESCO World TVET Report 2013Uploaded bysmariano908
- ASTOLOGY ProspectusUploaded byTarak Bhardwaj
- TAN2Uploaded byMelric Lamparas
- RAF List Apr 1939Uploaded byRobert MacDonald
- ReadmeUploaded byMatias Saukkola
- BLRBACUploaded byJabulani2010
- ENGUploaded byShahil Alam
- am1617-drabik-problemset1Uploaded byAdriana Sena
- Method Statement for Concrete Repairs Rev 1Uploaded bydicky1969
- Writing Review of Related LiteratureUploaded byBryan Jester
- Europe by Rail 2012 PDFUploaded byAngel
- Mgiti Course Fee StructureUploaded byMahatma Gandhi Industrial Training Institute
- Moringa Water TreatmentUploaded byE.a. Miranda
- 4970484Uploaded byHaripradeep
- Ch11HullOFOD9thEdition.pptxUploaded byJohn Paul Tuohy
- [Paper] P-CPICH Power and Antenna Tilt Optimization in UMTS NetworksUploaded byamr1287

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.