menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Self doubt

0 votes
95 views
The major difference betwen

Full binary tree, Complete binary tree, and strict binary tree
in Programming
reshown by 95 views
1
A full binary tree in which all internal node will have 2 children all leaf nodes(last level) will have 0 childrens.

A complete binary tree is in which tree is filled as much as left as possible. Like in heap we make complete binary tree.(First all left side nodes are filled than we fill the right sub-tree).

A strict binary tree will be if every non-leaf node is filled with a node. No non;leaf node will be empty.
0
Hi, please try to use Google before posting any trivial questions.
0

Hi, @Sasta_yoda 

See, What corman says

And now see what narasimha karumanchi says

And when i googled it then i found karumachi's defination correct. But corman is suggested by many topper that's why i thought it's better to ask someone.

 

0
Lemme settle this once and for all. Whenever you see such ambiguity there is a very high chance that the standard book is correct. Karumachi is a local author, moreover please know in Gate they always mention the definition if they feel it might have ambiguity.
0
Ok, thanks.

1 Answer

0 votes
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

0 votes
1 answer
1
644 views
Self Doubt:Infinite loop
#include<iostream> using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); } For this above code the output is only upto → 64891.Hello Does this mean that that the stack can hold only 64891 recursive calls? (I am using dev c++)
#include<iostream> using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); } For this above code the output is only upto → 64891.Hello Does this mean that that the stack can hold only 64891 recursive calls? (I am using dev c++)
asked Jun 2, 2019 in Programming Hirak 644 views
0 votes
1 answer
2
883 views
c-programming self doubt
#include<stdio.h> #include<stdlib.h> int main(void) { int maxLineCount = 500, maxCharCount = 500, index, j, count; char *line = NULL; size_t size; char *a[maxLineCount]; for (index = 0; index < maxLineCount; index++) a[index] = ... code is doing. suppose we have 3 string given as input in 3 different lines then how can we access each character of the string?
#include<stdio.h> #include<stdlib.h> int main(void) { int maxLineCount = 500, maxCharCount = 500, index, j, count; char *line = NULL; size_t size; char *a[maxLineCount]; for (index = 0; index < maxLineCount; index++) a[index] = (char *)malloc(maxCharCount * ... of the code is doing. suppose we have 3 string given as input in 3 different lines then how can we access each character of the string?
asked Jun 1, 2019 in Programming Satbir 883 views
1 vote
1 answer
3
379 views
Self doubt Data structures
Implement Linked list using stack.
Implement Linked list using stack.
asked May 19, 2019 in Programming shraddha priya 379 views
2 votes
2 answers
4
299 views
Self Doubt-Programming
Can someone explain the output of this code? and what (char*) is doing actually? #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", '*((char*)q+1)', '*((char*)q+2)'); return 0; }
Can someone explain the output of this code? and what (char*) is doing actually? #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", '*((char*)q+1)', '*((char*)q+2)'); return 0; }
asked May 13, 2019 in Programming srestha 299 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...