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 ! |
Quote:
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 06:44 AM. |