Warning:
JavaScript is turned OFF. None of the links on this page will work until it is reactivated.
If you need help turning JavaScript On, click here.
This Concept Map, created with IHMC CmapTools, has information related to: Binary Tree, Heap (9, 4) Fixes Reheapify (_, 6), Heap (9, 4) Can be used to Sort (_, 8), Heap (9, 4) Important Process Removing From a Heap (_, 8), Node (1, 1) has an Attribute (2, 1), Adding to a Heap (_, 6) Implemented Using Code (8,3), Heap (9, 4) Is a Binary Tree (1, 1), Root Node (1, 1) is a Node (1, 1), Leaf Node (1, 1) Has No Child Node (1, 1), Heap (9, 4) Is Balanced (5, 3), Heap Sort (_, 8) Is a Sort (_, 8), Binary Tree (1, 1) Has A Root Node (1, 1), Node (1, 1) Has 0, 1, or 2 Child Node (1, 1), Binary Tree (1, 1) has a Depth (1, 2), Heap Sort (_, 8) first step Create Initial Heap (_, 9), Heap Sort (_, 8) Second step Swap (_, 10), Binary Tree (1, 1) is a Data Structure (1, 1), Heap (9, 4) Implemented Using Array (6, _), Heap (9, 4) Important Process Adding to a Heap (_, 6), Heap Sort (_, 8) operates on Array (6, _), Binary Tree (1, 1) Implemented Using Code (8,3)