Concept of Trees

Trees

Concept of Trees

  1. A tree is a connected undirected graph which cannot contain multiple edges or loops.
  2. <...}

Operation in Binary Tree

Trees

Operation in Binary Tree

  1. Every node in the binary tree can have at most two children.
  2. Binary trees are most...}

Tree Traversals (pre‐order, post‐order and in‐order)

Trees

Tree Traversals (pre‐order, post‐order and in‐order)

  1. A binary tree is recursively defined as every node in it consists of a root (or the node it...}

Tree search, insertion/deletions

Trees

Tree search, insertion/deletions

  1. Trees provide quick insertion, deletion and searching capabilities.
  2. Binary search...}

AVL balanced trees and Balancing algorithm

Trees

AVL balanced trees and Balancing algorithm

  1.  An AVL tree is a binary search tree with a balance condition such that for every inte...}

The Huffman algorithm

Trees

The Huffman algorithm

  1. Huffman codes can be used to compress information.
  2. Instead of storing each charact...}

B‐Tree

Trees

B‐Tree

  1. In B-Trees, a node can store more than one value(key) and it can have more than two childre...}

Red Black Tree

Trees

Red Black Tree

  1. Red-black trees are a variation of binary search trees to ensure that the tree is balanced....}