#! /Usr/bin/ENV pythonclass btnode: def _ init _ (self, Data, left, right): Self. data = data self. left = left self. right = rightclass btree: def _ init _ (self, root): Self. root = root; def insert (self, value): Self. insertnode (value, self. root) def insertnode (self, Data, btnode): If btnode = none: btnode = btnode (data, none, none) Elif data <btnode. data: If btnode. left = none: btnode. left = btnode (data, none, none) return self. insertnode (data, btnode. left) Elif DATA> btnode. data: If btnode. right = none: btnode. right = btnode (data, none, none) return self. insertnode (data, btnode. right) def printbtreeimpl (self, btnode): If btnode = none: return self. printbtreeimpl (btnode. left) print btnode. data self. printbtreeimpl (btnode. right) def printbtree (Self): Self. printbtreeimpl (self. root) If _ name _ = '_ main _': Root = btnode (2, none, none) btree = btree (Root) for I in [5, 8, 3, 1, 4, 9, 0, 7]: btree. insert (I) btree. printbtree ()