DSA · Theory

Burkhard Keller Tree ( BK Tree )

← All stacks

Theory

761/810

Burkhard Keller Tree ( BK Tree )

Burkhard Keller Tree ( BK Tree ) is simple if you keep it on paper. Amit uses it for folder on disk in a file explorer.

Do Burkhard Keller Tree ( BK Tree ) once by hand. left < root < right. Change one input. Say the new result out loud.

Without Burkhard Keller Tree ( BK Tree ), a file explorer gets messy and folder on disk is hard to trust.

Amit ships Burkhard Keller Tree ( BK Tree ) in a file explorer. That is the use case worth saying.

Burkhard Keller Tree ( BK Tree ) trap — unbalanced BST becoming a list. Amit loses marks for that every viva.

Place Burkhard Keller Tree ( BK Tree ) next to nearby DSA work — left < root < right is the link.

One breath for Burkhard Keller Tree ( BK Tree ), then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Burkhard Keller Tree ( BK Tree ) in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Burkhard Keller Tree ( BK Tree )
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Burkhard Keller Tree ( BK Tree ): dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefBurkhard Keller Tree ( BK Tree ) — Amit uses it for folder on disk in a file explorer.
RuleBurkhard Keller Tree ( BK Tree ) → left < root < right.
RememberBurkhard Keller Tree ( BK Tree ) + time vs memory (a file explorer).
UseBurkhard Keller Tree ( BK Tree ) in a file explorer (folder on disk).
TrapBurkhard Keller Tree ( BK Tree ) — unbalanced BST becoming a list.
ExBurkhard Keller Tree ( BK Tree ) → folder on disk.

DSA · Theory

Burkhard Keller Tree ( BK Tree )

← All stacks

Theory

761/810

Burkhard Keller Tree ( BK Tree )

Burkhard Keller Tree ( BK Tree ) is simple if you keep it on paper. Amit uses it for folder on disk in a file explorer.

Do Burkhard Keller Tree ( BK Tree ) once by hand. left < root < right. Change one input. Say the new result out loud.

Without Burkhard Keller Tree ( BK Tree ), a file explorer gets messy and folder on disk is hard to trust.

Amit ships Burkhard Keller Tree ( BK Tree ) in a file explorer. That is the use case worth saying.

Burkhard Keller Tree ( BK Tree ) trap — unbalanced BST becoming a list. Amit loses marks for that every viva.

Place Burkhard Keller Tree ( BK Tree ) next to nearby DSA work — left < root < right is the link.

One breath for Burkhard Keller Tree ( BK Tree ), then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Burkhard Keller Tree ( BK Tree ) in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Burkhard Keller Tree ( BK Tree )
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Burkhard Keller Tree ( BK Tree ): dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefBurkhard Keller Tree ( BK Tree ) — Amit uses it for folder on disk in a file explorer.
RuleBurkhard Keller Tree ( BK Tree ) → left < root < right.
RememberBurkhard Keller Tree ( BK Tree ) + time vs memory (a file explorer).
UseBurkhard Keller Tree ( BK Tree ) in a file explorer (folder on disk).
TrapBurkhard Keller Tree ( BK Tree ) — unbalanced BST becoming a list.
ExBurkhard Keller Tree ( BK Tree ) → folder on disk.

Burkhard Keller Tree ( BK Tree )

Example

Short notes

Questions

Burkhard Keller Tree ( BK Tree )

Example

Short notes

Questions