DSA · Theory

Find the In-Order Successor of a Node in a Binary Tree

Theory

333/810

Find the In-Order Successor of a Node in a Binary Tree

Find the In-Order Successor of a Node in a Binary Tree sits in a file explorer. Rohit’s job is folder on disk. Write that first.

Do Find the In-Order Successor of a Node in a Binary Tree once by hand. left < root < right. Change one input. Say the new result out loud.

Skip Find the In-Order Successor of a Node in a Binary Tree and unbalanced BST becoming a list shows up in a file explorer.

Rohit ships Find the In-Order Successor of a Node in a Binary Tree in a file explorer. That is the use case worth saying.

If folder on disk breaks under Find the In-Order Successor of a Node in a Binary Tree, check unbalanced BST becoming a list first.

Find the In-Order Successor of a Node in a Binary Tree is not a lonely heading. Rohit ties it to folder on disk.

One breath for Find the In-Order Successor of a Node in a Binary Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Find the In-Order Successor of a Node in a Binary Tree in one breath, then left < root < right, then 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))

Find the In-Order Successor of a Node in a Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefFind the In-Order Successor of a Node in a Binary Tree — Rohit uses it for folder on disk in a file explorer.
RuleFind the In-Order Successor of a Node in a Binary Tree → left < root < right.
RememberFind the In-Order Successor of a Node in a Binary Tree + time vs memory (a file explorer).
UseFind the In-Order Successor of a Node in a Binary Tree in a file explorer (folder on disk).
TrapFind the In-Order Successor of a Node in a Binary Tree — unbalanced BST becoming a list.
ExFind the In-Order Successor of a Node in a Binary Tree → 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))

Find the In-Order Successor of a Node in a Binary Tree

Example

Short notes

Questions

Find the In-Order Successor of a Node in a Binary Tree

Example

Short notes

Questions