his answer is ri8
What is difference among Binary Tree, Complete Binary Tree and Binary Search Tree?View more random threads:
- what is buffer ptr and char* in c ++ 2011 ?
- Pointers are not accessible for static member funcion
- Creating File Associations in c++ 2011
- Bitwise Operators ( &, |, ^, ~, <<, >> ) May...
- how can we write the postfix expression of 3 + 5 * 6 – 7 *...
- What data type will be used in C++ program?
- how to implement java's MAC libraries for a file 2011
- Which of the function call is call by value for the...
- Linux Unix Windows Mac OS If a function has not been...
- what are subtyping and specilization?
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.
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.
Sponsored Links
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)