/
NotesMar26.py
44 lines (36 loc) · 1.02 KB
/
NotesMar26.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#2 binary trees: find if same set of unique elements
"""
One method is Recursion
add_element(key)
p_node = find_parent(node, key)
if(key < node.data && node.left)
return f_p(node.left, key)
find_parent(n, k){
if n.data > k {
if n.left{
return f_p(n.left, k)
}
else{
return n
}
}
if (n.data < k) {
if (n.right) {
return f_p(n.right, k)}
else{
return n }
}
add_node_r(key):
if isEmpty(){
treeNode = TreeNode(key)
root = treeNode }
else{
newNode = TreeNode(key)
p_node = find_parent(root, key)
if p_node.data > key {
p_node.left = newNode
newNode.parent = p_node }
elif p_node.data < key {
p_node.right = newNode
newNode.parent = p_node }
else {