A binary tree can easily be converted into q 2-tree

Question:A binary tree can easily be converted into q 2-tree

1.by replacing each empty subtree by a new internal node

2.by inserting an internal node for non-empty node

3.by inserting an external node for non-empty node

4.by replacing each empty subtree by a new external node


Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!