his answer is ri8
What is difference among Binary Tree, Complete Binary Tree and Binary Search Tree?View more random threads:
- What is difference b/w child class and parent class
- can we use Microsoft Visual Studio Ultimate 2010 for...
- sir i cant under stand function and cant apply it in...
- Balance of the AVL tree im Data structure 2012
- how often do we require to use inline functions and macros....
- Pointers in c++ 2011
- what is cursor and why we use it. what is difference...
- how many malloc ,calloc and realloc take arguments in c++
- difference between implementation and encapsulation,How can...
- factorial in C++ code 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.
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)