0 votes 0 votes The major difference betwen Full binary tree, Complete binary tree, and strict binary tree saif asked Jan 30, 2019 • reshown Jan 31, 2019 by saif saif 586 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply raahul commented Jan 30, 2019 reply Follow Share 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. 1 votes 1 votes Sasta_yoda commented Jan 30, 2019 reply Follow Share Hi, please try to use Google before posting any trivial questions. 0 votes 0 votes saif commented Jan 31, 2019 reply Follow Share 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 votes 0 votes Sasta_yoda commented Jan 31, 2019 reply Follow Share 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 votes 0 votes saif commented Jan 31, 2019 reply Follow Share Ok, thanks. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes check this.. https://stackoverflow.com/questions/12359660/difference-between-complete-binary-tree-strict-binary-tree-full-binary-tre vishal_bittoo answered Jan 31, 2019 vishal_bittoo comment Share Follow See all 0 reply Please log in or register to add a comment.