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
What are the four characteristics of algorithms?
What is space complexity of a program?
List all data structures you would use for a memory management module.
What are the disadvantages of circular list?
Explain the priority queue?
What should be done in the base case for this recursive problem?
What is the difference between one and two dimensional?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
Write an algorithm to check if there is a loop in a doubly linked list.
Explain what is binary search?
Why do we use trees in data structures?
Which type of sorting is best?
Explain pre-order and in-order tree traversal.
How many types of linked list are there?
What is 2 dimensional linked list?
