Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.


  • Presentation
  • Question
  • Answer

Question
In algorithms/python, when implementing Binary Tree functionality, you do so via the below Tree class, as well as the underlying Node class. Defince the Node class. 
class Tree:
    def __init__(self):
        self.root = None
...
...
Answer
class Node:
    def __init__(self, data):
        self.data = data
        self.left_child = None
        self.right_child = None

Question
In algorithms/python, when implementing Binary Tree functionality, you do so via the below Tree class, as well as the underlying Node class. Defince the Node class. 
class Tree:
    def __init__(self):
        self.root = None
...
...
Answer
?

Question
In algorithms/python, when implementing Binary Tree functionality, you do so via the below Tree class, as well as the underlying Node class. Defince the Node class. 
class Tree:
    def __init__(self):
        self.root = None
...
...
Answer
class Node:
    def __init__(self, data):
        self.data = data
        self.left_child = None
        self.right_child = None
If you want to change selection, open document below and click on "Move attachment"

pdf

owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p151

Summary

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Details

No repetitions

Discussion

Do you want to join discussion? Click here to log in or create user.