his answer is ri8
What is difference among Binary Tree, Complete Binary Tree and Binary Search Tree?View more random threads:
- What is mean by octet? how they are converted? in C++ 2012
- Why Encpsultion is used in OOP?
- What is a Dangling pointer? Briefly explane with example.
- Memory pool & char array questions in C++ for 2011
- What is the syntax of copy constructor in c 2011
- f i use hints for book ie(c++ How to Program 5th Edition)...
- binary tree,the pre and post order traversal have the same...
- what is Buffer in c++ 2011
- Is constructor necessory in c++? And if than why?
- what is difference between PATH and CIRCUIT in c++ 2011?
A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.
Complete Binary Tree: A complete binary is a binary tree in which all non-leaf nodes have two children and all leaf nodes are found at tree depth level. OR
A binary tree which is completely filled except possibly for bottom level, which filled from left to right.
Sponsored Links
A Binary search tree is a special type of binary tree with added property that for each node, the left child is less than parent is less than or equal to right child.
his answer is ri8
you are welcome dear.
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
There are currently 1 users browsing this thread. (0 members and 1 guests)