–1 votes –1 votes IS IT A CBT? DS data-structures binary-tree + – iarnav asked Jan 7, 2018 iarnav 515 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srestha commented Jan 7, 2018 reply Follow Share 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 votes 0 votes joshi_nitish commented Jan 7, 2018 reply Follow Share 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 votes 3 votes iarnav commented Jan 7, 2018 reply Follow Share @ joshi_nitish thanks for the best and most appropriate answer. 0 votes 0 votes Please log in or register to add a comment.
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. rangerix answered Jan 7, 2018 rangerix comment Share Follow See all 0 reply Please log in or register to add a comment.