Interested to Buy Any Domain ? << Click Here >> for more details...
what is binary tree?
- 12 Answers
- 20484 Views
- BMC, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / duchinna198227
A tree with at most two children for each node.
OR
A binary tree either
* is empty (no nodes), or
* has a root node, a left binary tree, and a right
binary tree.
| Is This Answer Correct ? | 32 Yes | 3 No |
Answer / kushal bagaria
Binary tree is a tree which has maximum no. of childrens
either 0 or 1 or 2. i.e., there is at the most 2 branches in
every node.
| Is This Answer Correct ? | 20 Yes | 2 No |
Answer / 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 |
Answer / raji
Binary tree is a tree in which a node can have less than or
equal to two children
| Is This Answer Correct ? | 11 Yes | 0 No |
Answer / sri
A binary tree is a tree which is either empty or each node
has at-most two children
The root node is the parent of all the nodes
its height is given by log n base 2 where n is the no of
elements
| Is This Answer Correct ? | 3 Yes | 0 No |
Answer / r. khan
A tree with root[T]has the following properties
if roo[T] is NULL, then there is no node,
otherwise,every node in the tree has at most two child
nodes.
| Is This Answer Correct ? | 9 Yes | 7 No |
Answer / n.k
Binary tree is a tree which has at most two sub node namely
left sub tree and right sub tree or may be null
| Is This Answer Correct ? | 3 Yes | 1 No |
Answer / guest
binary tree is parent node have maximum 2 child. that type
of tree is called as binary tree
| Is This Answer Correct ? | 3 Yes | 1 No |
Answer / tadveer verma
a tree which has atmost two child is called a binary tree.
| Is This Answer Correct ? | 3 Yes | 3 No |
What is linked list with example?
What is a property class?
What is the best time complexity of bubble sort?
Which is faster binary or linear search?
When will we get ArrayStoreException?
Is arraylist a collection?
What is mean by sorting?
When is a binary search algorithm best applied?
What is the data structures used to perform recursion?
What is the difference between an array and vector?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
What is data structure and data type?
Windows 
