Binary Tree

robertfield258
Mind Map by robertfield258, updated more than 1 year ago
robertfield258
Created by robertfield258 about 6 years ago
46
1

Description

University ADS2 (Binary Trees & Trees) Mind Map on Binary Tree, created by robertfield258 on 03/11/2014.
Tags

Resource summary

Binary Tree
1 Non-linear
1.1 Data
1.2 above
1.3 below
1.4 part of
2 Natural
2.1 File System
2.2 GUI
2.3 Database
2.4 Website
2.5 Inheritance
2.5.1 Java
2.6 Books
2.6.1 Chapters
2.6.2 Sections
2.6.3 Subsections
3 Relationships
3.1 Parent
3.2 Children
3.3 Siblings
3.4 Ancestors
3.5 Descendents
4 Nodes
4.1 Set
4.2 One
4.2.1 Parent
4.2.1.1 Except
4.2.1.1.1 Root
4.2.1.1.1.1 None
4.3 n
4.4 Path
4.4.1 Unique
4.4.1.1 Root
4.5 Depth
4.5.1 Distance
4.5.1.1 Root
4.6 Height
4.6.1 Leaf
4.6.1.1 Zero
4.6.1.2 Children
4.6.1.2.1 null
4.6.2 Maximimum
4.6.2.1 Child
4.6.2.1.1 height
4.7 Contains
4.7.1 Left
4.7.2 Right
4.7.3 Value
4.7.4 Either
4.7.4.1 Empty
4.7.4.2 Node
4.7.4.2.1 Binary Tree
4.7.4.2.1.1 Recursive
5 Edges
5.1 n-1
6 no cycles
7 Taversal
7.1 Preorder
7.1.1 Parent
7.1.1.1 Child
7.1.2 Parenthetic
7.1.2.1 Representation
7.1.3 O(n)
7.2 Postorder
7.2.1 Child
7.2.1.1 Parent
7.2.2 O(n)
7.2.3 Use
7.2.3.1 Assemble
7.2.3.1.1 Parts
7.2.4 Euler
7.2.4.1 Walk
7.3 BFS
7.3.1 Depth
7.3.1.1 All
7.3.1.1.1 Before
7.3.1.1.1.1 Next
7.3.2 breadth
7.3.2.1 first
7.3.2.1.1 search
7.3.3 O(n)
7.4 Inorder
7.4.1 Left 1
7.4.1.1 Subtree
7.4.1.1.1 Bottom up
7.4.2 Right 3
7.4.2.1 Subtree
7.4.2.1.1 Bottom up
7.4.3 Root 2
7.4.4 Start
7.4.4.1 Left
7.4.4.1.1 Leaf
8 Forest
8.1 Multple
8.1.1 Trees
9 Balance
9.1 Shape
9.2 Injective
9.2.1 No
9.2.1.1 Duplicate
9.2.1.1.1 Values
9.2.2 Set
10 Expression
11 Search Tree
11.1 Elements
11.1.1 Unique
11.1.2 Node
11.1.2.1 Left
11.1.2.1.1 Less Than
11.1.2.2 Right
11.1.2.2.1 Greater than
11.2 Traversal
11.2.1 Inorder
11.2.1.1 Sorted
11.3 Time
11.3.1 Avereage
11.3.1.1 O(log n)
11.4 Insert x
11.4.1 Must
11.4.1.1 add
11.4.1.1.1 Leaf
11.4.2 Keep
11.4.2.1 Left
11.4.2.1.1 Less Than
11.4.2.2 Right
11.4.2.2.1 Greater than
11.4.3 If x > node
11.4.3.1 Go right
11.4.3.2 Else Go Left
11.5 Remove x
11.5.1 Find
11.5.1.1 Smallest
11.5.1.1.1 Right
11.5.1.1.1.1 Subtree
11.5.2 Swap
11.5.2.1 Smallest
11.5.2.1.1 Right
11.5.2.1.1.1 x
11.5.3 Move
11.5.3.1 Right
11.5.3.1.1 Smallest
11.5.3.1.1.1 Left
11.5.3.1.1.1.1 Parent
11.5.3.1.1.1.1.1 Smallest
11.6 Node
11.6.1 Internal
11.6.1.1 Two
11.6.1.1.1 Children

Media attachments

Show full summary Hide full summary

Similar

F453 Data Structures - Binary Trees
harvs899
Data representation, types and structures
bubblesthelabrad
Modelo Vista Controlador (MVC)
trane64
What were the Cause and Consequences of The Cuban Missile Crisis October 1962
matthewnr73
SAT Math Sample Questions
SAT Prep Group
GCSE ICT Revision
Andrea Leyden
Chemistry Module C2: Material Choices
James McConnell
World War One
Micheal Heffernan
PREPARACIÓN Y PRESENTACIÓN DE REPORTES DE INVESTIGACIÓN DE MERCADOS
Dulce Diaz
seis procesos de la ARH. Administración de Recursos Humanos
Yery Takigawa Guzmán
POSTURA
Mónica Romero