# trees

## Binomial Trees

Binomial Trees are one of  the type of trees that are defined  recursively. A Binomial tree of order 0 is a single node and a binomial tree of order n has a root node whose children are roots of binomial trees of order n-1, n-2, n-3, n-4, ……3,2,1,0. Properties of Binomial Tree There are 2n nodes in… read more »

## Deletion In B-Trees

In order to delete elements from B-Tree we need to ensure that their properties(Refer : http://letslearncs.com/b-trees/ does not get violated.It should remain a binary search tree and number of pointers must be according to the order and keys should be one less than the order in each and every node. Example Consider a B-tree of Fig 1.Say… read more »

## B-Trees

The B-tree is a generalization of a binary search tree  in which a node can have more than two children .The B-tree is optimized for systems that read and write large blocks of data.It has following properties The data items are stored at leaves. Every node has between M/2 and M children where M is a… read more »

## Traversal in Binary Trees

Traversal means to move across/visit each and every node in the tree.There are three techniques to traverse a Binary Tree : Preorder Inorder Postorder Preorder traversal In preorder traversal,firstly  the root is traversed then left subtree and in the last right subtree(Fig 1). Example Consider the following binary tree(Fig 2) :   Root is traversed in… read more »

## Representation of Binary Trees in Memory

Binary trees in memory can be represented by Array Linked Lists Representation through Arrays Binary Trees can be represented using 1-D array in memory(Fig 1).The rule to store binary tree in array are : The values of binary tree is stored in an array called as tree. The root of the tree is stored at… read more »

## Binary Trees

Binary Trees are the data structure defined by collection of elements called nodes.They are one of the efficient data structures for searching and insertion operations.The topmost node of binary tree is known as ROOT node  pointed by ROOT pointer.Root node has  left child/successor and  right child/successor pointed by left and right pointers(Fig 1). The left… read more »

Sidebar