You are viewing a single comment's thread. Return to all comments →
Great visualization
Recursive:
def insertion(self, cur, val): if not cur: cur = Node(val) elif cur.info > val: cur.left = self.insertion(cur.left, val) else: cur.right = self.insertion(cur.right, val) return cur def insert(self, val): if not self.root: self.root = Node(val) else: self.insertion(self.root, val)
Iterative:
def insert(self, val): cur = self.root if not cur: self.root = Node(val) return self.root while cur: if cur.info > val: if cur.left: cur = cur.left else: cur.left = Node(val) break else: if cur.right: cur = cur.right else: cur.right = Node(val) break return self.root
Binary Search Tree : Insertion
You are viewing a single comment's thread. Return to all comments →
Great visualization
Recursive:
Iterative: