DSA · Theory

Clone a Binary Tree with Random Pointers

← All stacks

Theory

352/810

Clone a Binary Tree with Random Pointers

Clone a Binary Tree with Random Pointers is a DSA idea you prove with folder on disk, not with a slogan.

For Clone a Binary Tree with Random Pointers, Big-O is in play. Don’t blame it until you have traced folder on disk.

Skip Clone a Binary Tree with Random Pointers and unbalanced BST becoming a list shows up in a file explorer.

Arun ships Clone a Binary Tree with Random Pointers in a file explorer. That is the use case worth saying.

Don’t do this with Clone a Binary Tree with Random Pointers: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

After Clone a Binary Tree with Random Pointers, Arun should still remember unbalanced BST becoming a list.

One breath for Clone a Binary Tree with Random Pointers, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Board: folder on disk. Dry-run Clone a Binary Tree with Random Pointers. Name the trap: unbalanced BST becoming a list.

Example

class Node:
    def __init__(self, val, left=None, right=None):
        self.val, self.left, self.right = val, left, right

def inorder(n):
    if not n:
        return []
    return inorder(n.left) + [n.val] + inorder(n.right)

root = Node(2, Node(1), Node(3))
print(inorder(root))

Clone a Binary Tree with Random Pointers — inorder walks left → node → right (sorted order for a BST).

Short notes

DefClone a Binary Tree with Random Pointers — Arun uses it for folder on disk in a file explorer.
RuleClone a Binary Tree with Random Pointers → left < root < right.
RememberClone a Binary Tree with Random Pointers + Big-O (a file explorer).
UseClone a Binary Tree with Random Pointers in a file explorer (folder on disk).
TrapClone a Binary Tree with Random Pointers — unbalanced BST becoming a list.
ExClone a Binary Tree with Random Pointers → folder on disk.

class Node: def __init__(self, val, left=None, right=None): self.val, self.left, self.right = val, left, right def inorder(n): if not n: return [] return inorder(n.left) + [n.val] + inorder(n.right) root = Node(2, Node(1), Node(3)) print(inorder(root))

Clone a Binary Tree with Random Pointers

Example

Short notes

Questions

Clone a Binary Tree with Random Pointers

Example

Short notes

Questions