515 views
–1 votes
–1 votes

IS IT A CBT?

1 Answer

0 votes
0 votes
A complete binary tree is a binary tree, in which every level ,except possibly the last level , is completely filled and all nodes are as far left as possible.

So , this is a complete binary tree.

Related questions

0 votes
0 votes
5 answers
1
radha gogia asked Sep 30, 2015
1,606 views
If I am given an array $X$ of $n$ distinct integers which is interpreted as a complete binary tree, so if the parent is at index $i$, then it's left child would be at ind...
0 votes
0 votes
1 answer
2
Prince Sindhiya asked Jan 2, 2019
701 views
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
2 votes
2 votes
3 answers
3
4 votes
4 votes
2 answers
4
Parth Shah asked Dec 11, 2018
1,380 views
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is?A)C-A-BB)A-...