–1 –1 vote IS IT A CBT? Data Structures data-structures binary-tree + – iarnav 1.1k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply srestha commented Jan 7, 2018 reply Follow flag yes, CBT 0 0 replyShare iarnav commented Jan 7, 2018 reply Follow flag @srestha please refer the above cbt and try solving this gate question-https://gateoverflow.in/663/gate2000-2-16 0 0 replyShare srestha commented Jan 7, 2018 reply Follow flag if one example is not matching, then u can say statement false u can see diagram below the selected ans It will clear ur concept, why d) is ans 0 0 replyShare joshi_nitish commented Jan 7, 2018 reply Follow flag it is almost complete binary tree. almost complete binary tree -> leaf nodes can be at level n and level n-1 complete binary tree -> all leaf nodes are at level n. 3 3 replyShare iarnav commented Jan 7, 2018 reply Follow flag @ joshi_nitish thanks for the best and most appropriate answer. 0 0 replyShare Please log in or register to add a comment.
0 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. rangerix answered Jan 7, 2018 rangerix comment Share Follow 0 reply Please log in or register to add a comment.
