Understanding Binary Trees Part 1

4 years ago dzone.com

Summary: This is a summary of an article originally published by the source. Read the full original article here →

Unlike Arrays, Linked Lists, Stack, and Queues, which are linear data structures, trees are hierarchical data structures. Trees represent non-linear data structures and can be defined as collection of entities called “Nodes” linked together to simulate hierarchy.

The following are common types of Binary Trees: A full binary tree is called a binary tree in which each node has exactly In a full binary tree, number of leaf nodes = No. of internal nodes + 1Properties of full binary tree: For any binary tree of height “h”, minimum number of nodes = 2h + 1 =>n=2h+1

A balanced binary tree is a binary tree structure in which the left and right sub-trees of every node differ in height by no more than 1.

DevOps Articles