Proof induction that the infix list of binary tree research (BTR) are ordered

后端 未结 0 1178
梦如初夏
梦如初夏 2020-11-27 03:57

i did this function difinition

infixBTR(beT, racine,list)
  infix(leftTree,racineLeftTree)
  insert(racine, list)
  infix(rightTree, racineRightTree)
<         


        
相关标签:
回答
  • 消灭零回复
提交回复
热议问题