LinuxQuestions.org

LinuxQuestions.org (/questions/)
-   Programming (https://www.linuxquestions.org/questions/programming-9/)
-   -   what is the difference strict binary tree nad extended binary tree . (https://www.linuxquestions.org/questions/programming-9/what-is-the-difference-strict-binary-tree-nad-extended-binary-tree-4175415189/)

tushar_pandey 07-06-2012 03:26 AM
what is the difference strict binary tree nad extended binary tree .
 
because they both have , either 0 children or 2 children !

& another question . if we have [ not ] operator in our binary tree than it is necessary to use inorder algoritm with that tree ! or we can use pre-order or post-order algorithm !

dmdeb 07-18-2012 11:30 AM
Quote:
Originally Posted by tushar_pandey (Post 4720605)
because they both have , either 0 children or 2 children !

& another question . if we have [ not ] operator in our binary tree than it is necessary to use inorder algoritm with that tree ! or we can use pre-order or post-order algorithm !
As for "extended binary trees", see http://mathworld.wolfram.com/ExtendedBinaryTree.html - it's just a way of representing binary trees that can be convenient at times.

I fear the phrase "have a NOT operator in our binary tree" does not make any sense. How do trees contain operators? In general, trees simply contain nodes. Or are you talking about specific trees? If so, which variety? Maybe Boolean expressions encoded as trees of operators and operands?


All times are GMT -5. The time now is 01:49 PM.