What is binary tree?
Answers were Sorted based on User's Feedback
A binary tree is a tree in which each node can have at most
two children. (i.e., left child and/or right child)
Is This Answer Correct ? | 39 Yes | 5 No |
Answer / wizard
A binary tree is a tree which has every node has exactly two
links i.e left and right link
Is This Answer Correct ? | 30 Yes | 7 No |
Answer / ajay
A binary tree is a data structure in which the nodes
contains at most two links(i.e.,left child and/or right
child)
Is This Answer Correct ? | 18 Yes | 1 No |
Answer / babita
A tree with at most two children for each node.
Is This Answer Correct ? | 13 Yes | 1 No |
Answer / veeru
A binary tree is a tree in which the degree of a node
maximum 2 is called a binary tree.
Is This Answer Correct ? | 7 Yes | 1 No |
Answer / chinnadurai.s
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 ? | 5 Yes | 0 No |
Answer / ashutosh
a binary tree is a tree in which each naode have 2 child
except leaf naode.
Is This Answer Correct ? | 5 Yes | 2 No |
Answer / himani madan
A binary tree is a tree in which each node has either 0 or 2
child nodes.
Is This Answer Correct ? | 5 Yes | 4 No |
Answer / saurabh
A binary tree is a tree in which all nodes are connected and
each node has indegree of maximum and outdegree of maximum 2
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / naz
A Binary Tree is a finite set of elements called Node.....
Is This Answer Correct ? | 6 Yes | 6 No |
What is time and space complexity of bubble sort?
Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?
What is quick sort?
Which interfaces are implemented by linkedhashset?
Explain circular linked list?
What is thread and types of thread?
How do you check if a stack is empty or not?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Which data structure is needed to convert infix notations to post fix notations?
Why do we need a data structure?
How to cut or remove an element from the array?
What is the difference between data type and data structure?