Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

what is binary tree?

Answer Posted / chinnadurai.s

binary tree is a tree data structure in which each node
has at most two children. Typically the first node is known
as the parent and the child nodes are called left and
right.Binary trees are commonly used to implement binary
search trees and binary heaps.

Types of binary trees are

* A rooted binary tree is a rooted tree in which every
node has at most two children.
* A full binary tree is a tree in which every node
other than the leaves has two children.
* A perfect binary tree is a full binary tree in which
all leaves are at the same depth or same level.This is
ambiguously also called a complete binary tree.
* A complete binary tree is a binary tree in which every
level, except possibly the last, is completely filled, and
all nodes are as far left as possible.
* An infinite complete binary tree is a tree with
levels, where for each level d the number of existing nodes
at level d is equal to 2d. T
* A balanced binary tree is where the depth of all the
leaves differs by at most 1. Balanced trees have a
predictable depth. This depth is equal to the integer part
of log2(n) where n is the number of nodes on the balanced tree.
Example 1: balanced tree with 1 node, log2(1) = 0 (depth = 0).
Example 2: balanced tree with 3 nodes, log2(3) = 1.59
(depth=1). Example 3: balanced tree with 5 nodes, log2(5) =
2.32 (depth of tree is 2 nodes).

* A rooted complete binary tree can be identified with a
free magma.
* A degenerate tree is a tree where for each parent
node, there is only one associated child node. This means
that in a performance measurement, the tree will behave like
a linked list data structure.

Is This Answer Correct ?    15 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

List out a few of the applications that make use of Multilinked Structures?

1116


Define heap?

999


Does hashset maintain order?

859


What happens if we put duplicate key in hashmap?

811


What is 2 dimensional linked list?

957


How do signed and unsigned numbers affect memory?

837


What is data structure operations?

965


Define data type and what are the types of data type?

839


Can you please explain the difference between string and an array?

1033


Which collection allows null values?

815


Is pointer a variable?

837


Is list a data structure?

909


Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.

1045


How do we find duplicate elements in an array?

920


Write a code for dynamic allocation of array.

981