Binary Tree

Descrição

University ADS2 (Binary Trees & Trees) Mapa Mental sobre Binary Tree, criado por robertfield258 em 11-03-2014.
robertfield258
Mapa Mental por robertfield258, atualizado more than 1 year ago
robertfield258
Criado por robertfield258 aproximadamente 10 anos atrás
157
1

Resumo de Recurso

Binary Tree
  1. Non-linear
    1. Data
      1. above
        1. below
          1. part of
          2. Natural
            1. File System
              1. GUI
                1. Database
                  1. Website
                    1. Inheritance
                      1. Java
                      2. Books
                        1. Chapters
                          1. Sections
                            1. Subsections
                          2. Relationships
                            1. Parent
                              1. Children
                                1. Siblings
                                  1. Ancestors
                                    1. Descendents
                                    2. Nodes
                                      1. Set
                                        1. One
                                          1. Parent
                                            1. Except
                                              1. Root
                                                1. None
                                          2. n
                                            1. Path
                                              1. Unique
                                                1. Root
                                              2. Depth
                                                1. Distance
                                                  1. Root
                                                2. Height
                                                  1. Leaf
                                                    1. Zero
                                                      1. Children
                                                        1. null
                                                      2. Maximimum
                                                        1. Child
                                                          1. height
                                                      3. Contains
                                                        1. Left
                                                          1. Right
                                                            1. Value
                                                              1. Either
                                                                1. Empty
                                                                  1. Node
                                                                    1. Binary Tree
                                                                      1. Recursive
                                                              2. Edges
                                                                1. n-1
                                                                2. no cycles
                                                                  1. Taversal
                                                                    1. Preorder
                                                                      1. Parent
                                                                        1. Child
                                                                        2. Parenthetic
                                                                          1. Representation
                                                                          2. O(n)
                                                                          3. Postorder
                                                                            1. Child
                                                                              1. Parent
                                                                              2. O(n)
                                                                                1. Use
                                                                                  1. Assemble
                                                                                    1. Parts
                                                                                  2. Euler
                                                                                    1. Walk
                                                                                  3. BFS
                                                                                    1. Depth
                                                                                      1. All
                                                                                        1. Before
                                                                                          1. Next
                                                                                      2. breadth
                                                                                        1. first
                                                                                          1. search
                                                                                        2. O(n)
                                                                                        3. Inorder
                                                                                          1. Left 1
                                                                                            1. Subtree
                                                                                              1. Bottom up
                                                                                            2. Right 3
                                                                                              1. Subtree
                                                                                                1. Bottom up
                                                                                              2. Root 2
                                                                                                1. Start
                                                                                                  1. Left
                                                                                                    1. Leaf
                                                                                              3. Forest
                                                                                                1. Multple
                                                                                                  1. Trees
                                                                                                2. Balance
                                                                                                  1. Shape
                                                                                                    1. Injective
                                                                                                      1. No
                                                                                                        1. Duplicate
                                                                                                          1. Values
                                                                                                        2. Set
                                                                                                      2. Expression
                                                                                                        1. Search Tree
                                                                                                          1. Elements
                                                                                                            1. Unique
                                                                                                              1. Node
                                                                                                                1. Left
                                                                                                                  1. Less Than
                                                                                                                  2. Right
                                                                                                                    1. Greater than
                                                                                                                2. Traversal
                                                                                                                  1. Inorder
                                                                                                                    1. Sorted
                                                                                                                  2. Time
                                                                                                                    1. Avereage
                                                                                                                      1. O(log n)
                                                                                                                    2. Insert x
                                                                                                                      1. Must
                                                                                                                        1. add
                                                                                                                          1. Leaf
                                                                                                                        2. Keep
                                                                                                                          1. Left
                                                                                                                            1. Less Than
                                                                                                                            2. Right
                                                                                                                              1. Greater than
                                                                                                                            3. If x > node
                                                                                                                              1. Go right
                                                                                                                                1. Else Go Left
                                                                                                                              2. Remove x
                                                                                                                                1. Find
                                                                                                                                  1. Smallest
                                                                                                                                    1. Right
                                                                                                                                      1. Subtree
                                                                                                                                  2. Swap
                                                                                                                                    1. Smallest
                                                                                                                                      1. Right
                                                                                                                                        1. x
                                                                                                                                    2. Move
                                                                                                                                      1. Right
                                                                                                                                        1. Smallest
                                                                                                                                          1. Left
                                                                                                                                            1. Parent
                                                                                                                                              1. Smallest
                                                                                                                                    3. Node
                                                                                                                                      1. Internal
                                                                                                                                        1. Two
                                                                                                                                          1. Children

                                                                                                                                    Anexos de mídia

                                                                                                                                    Semelhante

                                                                                                                                    F453 Data Structures - Binary Trees
                                                                                                                                    harvs899
                                                                                                                                    Data representation, types and structures
                                                                                                                                    bubblesthelabrad
                                                                                                                                    Modelo Vista Controlador (MVC)
                                                                                                                                    trane64
                                                                                                                                    Modelo Vista Controlador (MVC)
                                                                                                                                    Gerardo Hernandez
                                                                                                                                    Binary Tree
                                                                                                                                    Shaounak Nasikkar
                                                                                                                                    Biologia 10º ano
                                                                                                                                    indialovesea
                                                                                                                                    Como Estudar Matemática
                                                                                                                                    Alessandra S.
                                                                                                                                    GEOGRAFIA - GEOPOLITICA
                                                                                                                                    neusamiotto
                                                                                                                                    Enem 3
                                                                                                                                    Robson Bueno
                                                                                                                                    Reading IELTS Vocabulary
                                                                                                                                    Caio Uechi
                                                                                                                                    Instrumentação Cirúrgica
                                                                                                                                    Lia Argenton