Maratom
For the Better


Home Categories About Archive Search Tags

© 2020. All rights reserved.

Maratom's Study Blog

    Data Structure
  • Heap Implementation using Array

    Contents Characteristic of using array for heap Position index and heap in an array Insertion of data in Max Heap Basic principles Process of insertion Deletion of data in Max...

    Heap   16 Jun 2020

  • Data Structure
  • What is a Heap?

    Contents What is a heap ? Types of heap Max heap Min heap Abstract data type of Array Heap Operations for Array Heap Adding data Removing data About data structure...

    Heap   14 Jun 2020

  • Data Structure
  • Tree Traversals (Inorder, Preorder, Postorder, Levelorder)

    Contents What is Tree Traversals ? Terms for Tree Traversal Types of Tree Traversals 1. Pre-order 2. In-order 3. Post-order 4. Level-order aka Breadth-first traversal About Types of Tree Traversals...

    Tree   12 Jun 2020

  • Data Structure
  • Types of Binary Tree

    Contents What is a Binary Tree ? Types of Binary Tree 1. Perfect Binary Tree 2. Complete Binary Tree 3. Skewed Binary Tree 4. Full Binary Tree 5. Balanced Binary...

    Tree   11 Jun 2020

  • Data Structure
  • What is a Tree ?

    Contents What is a Tree ? What is an Edge? Type of Node Root and Edge Internal node and Leaf node Parent, child and Sibling node Descendant and Ancestor node...

    Tree   09 Jun 2020

Previous Page: 6 of 7 Next