Binary Tree Archives - SimpleTechTalks

Binary Tree data structures explained

Tree data structures are similar to Linked list in which each node points to multiple nodes instead of simply pointing to the next node. A tree is called Binary tree if each node in a tree has maximum of two nodes.

An empty tree is also a Binary tree. We can call the two children of each node as Left and Right child of a node. The node of the tree which has no parent is called the Root of the tree. Perhaps Binary tree is the most used tree data structure in the programming world.

Below are some examples of Binary Tree.

(more…)

Boundary Traversal Of A Binary Tree

by admin

A tree is a data structure similar to Linked list in which each node points to multiple nodes instead of simply pointing to the next node. A tree is called Binary tree if each node in a tree has maximum of two nodes.

Boundary traversal of a binary tree, traverses through all the boundary nodes which includes

The left boundary of a binary tree
All the leaves of the binary tree
The right boundary of a binary tree

Before going ahead have a look into Binary Tree basics, Binary Tree Traversal and Binary Tree implementation.

(more…)

Program To Find the Lowest Common Ancestor In Binary Tree

by admin

A tree is a data structure similar to Linked list in which each node points to multiple nodes instead of simply pointing to the next node. A tree is called Binary tree if each node in a tree has maximum of two nodes.
The lowest common ancestor of any two nodes X and Y in a binary tree is the lowest node in tree that has both X and Y node as successor.
Before going ahead have a look into Binary Tree basics, Binary Tree Traversal and Binary Tree implementation.

(more…)

Program to Convert Binary Tree to Sum Tree

by admin

A tree is a data structure similar to Linked list in which each node points to multiple nodes instead of simply pointing to the next node. A tree is called Binary tree if each node in a tree has maximum of two nodes.
An empty tree is also a Binary tree. We can call the two children of each node as Left and Right child of a node. The node of the tree which has no parent is called the Root of the tree. Perhaps Binary tree is the most used tree data structure in the programming world. Before going ahead have a look into Binary Tree basics, Binary Tree Traversal and Binary Tree implementation.

(more…)

Maximum Heap Explained With Simple Example

by admin

A Maximum Heap is a binary tree which has following properties:

Binary tree MUST be a complete binary tree which means all leaf nodes are present in either at height “h” or “h-1”.
Key stored in each node is smaller than or equal to keys in the node’s children.

Before going ahead, have a look into Binary Tree.

(more…)

Minimum Heap Explained With Simple Example

by admin

A minimum heap is a binary tree which has following properties:

Binary tree MUST be a complete binary tree which means all leaf nodes are present in either at height “h” or “h-1”.
Key stored in each node is smaller than or equal to keys in the node’s children.

Before going ahead have a look into Binary Tree.

(more…)

Binary Search Tree Searching OF Node Explained With Simple Example

by admin

A Binary Search Tree is a Binary tree in which all the nodes has following properties.

Left subtree of a node contains all the nodes having values lesser than the node.
Right subtree of a node contains all the nodes having values higher than the node.
Both the left and right subtree is also a Binary Search Tree.

As the name suggests, this data structure is mainly used for faster searching. In order to do that, restrictions are applied while inserting/deleting an element into the tree. As a result of these restrictions, worst case search time complexity remains at O(log n). Before going ahead have a look into Binary Search Tree basics.

(more…)

Binary Search Tree Deletion Of Node Explained With Simple Example

by admin

A Binary Search Tree is a Binary tree in which all the nodes has following properties.

Left subtree of a node contains all the nodes having values lesser than the node.
Right subtree of a node contains all the nodes having values higher than the node.
Both the left and right subtree is also a Binary Search Tree.

As the name suggests, this data structure is mainly used for faster searching. In order to do that, restrictions are applied while inserting/deleting an element into the tree. As a result of these restrictions, worst case search time complexity remains at O(log n). Before going ahead have a look into Binary Search Tree basics.

(more…)

Binary Search Tree Insertion Of Node Explained With Simple Example

by admin

A Binary Search Tree is a Binary tree in which all the nodes has following properties.

Left subtree of a node contains all the nodes having values lesser than the node.
Right subtree of a node contains all the nodes having values higher than the node.
Both the left and right subtree is also a Binary Search Tree.

As the name suggests, this data structure is mainly used for faster searching. In order to do that, restrictions are applied while inserting/deleting an element into the tree. As a result of these restrictions, worst case search time complexity remains at O(log n). Before going ahead have a look into Binary Search Tree basics.

(more…)

Binary Search Tree Explained With Simple Example

by admin

A Binary Search Tree is a Binary tree in which all the nodes has following properties.

Left subtree of a node contains all the nodes having values lesser than the node.
Right subtree of a node contains all the nodes having values higher than the node.
Both the left and right subtree is also a Binary Search Tree.

As the name suggests, this data structure is mainly used for faster searching. In order to do that, restrictions are applied while inserting/deleting an element into the tree. As a result of these restrictions, worst case search time complexity remains at O(log n).

(more…)