Interested to Buy Any Domain ? << Click Here >> for more details...
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
State the advantages of using postfix notations?
Run time memory allocation is known as in data structure?
How do you find the length of an arraylist?
What are different dynamic memory allocation technique in c.
Explain the Array
Are duplicates allowed in list?
How memory is reserved using a declaration statement in data structure?
Does linkedhashset allow duplicates?
What is the heap in data structures?
State the merits of linear representation of binary trees?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Define a binary search tree?
What is the minimum number of nodes in an avl tree of height h?
What is difference between map and hashmap?
What happens if an array goes out-of-bounds?
